537 research outputs found

    The Efficacy of Choosing Strategy with General Regression Neural Network on Evolutionary Markov Games

    Get PDF
    Nowadays, Evolutionary Game Theory which studies the learning model of players,has attracted more attention than before. These Games can simulate the real situationand dynamic during processing time. This paper creates the Evolutionary MarkovGames, which maps players’ strategy-choosing to a Markov Decision Processes(MDPs) with payoffs. Boltzmann distribution is used for transition probability andthe General Regression Neural Network (GRNN) simulating the strategy-choosing inEvolutionary Markov Games. Prisoner’s dilemma is a problem that uses the methodand output results showing the overlapping the human strategy-choosing line andGRNN strategy-choosing line after 48 iterations, and they choose the same strate-gies. Also, the error rate of the GRNN training by Tit for Tat (TFT) strategy is lowerthan similar work and shows a better re

    Techniques to Understand Computer Simulations: Markov Chain Analysis

    Get PDF
    The aim of this paper is to assist researchers in understanding the dynamics of simulation models that have been implemented and can be run in a computer, i.e. computer models. To do that, we start by explaining (a) that computer models are just input-output functions, (b) that every computer model can be re-implemented in many different formalisms (in particular in most programming languages), leading to alternative representations of the same input-output relation, and (c) that many computer models in the social simulation literature can be usefully represented as time-homogeneous Markov chains. Then we argue that analysing a computer model as a Markov chain can make apparent many features of the model that were not so evident before conducting such analysis. To prove this point, we present the main concepts needed to conduct a formal analysis of any time-homogeneous Markov chain, and we illustrate the usefulness of these concepts by analysing 10 well-known models in the social simulation literature as Markov chains. These models are: • Schelling\'s (1971) model of spatial segregation • Epstein and Axtell\'s (1996) Sugarscape • Miller and Page\'s (2004) standing ovation model • Arthur\'s (1989) model of competing technologies • Axelrod\'s (1986) metanorms models • Takahashi\'s (2000) model of generalized exchange • Axelrod\'s (1997) model of dissemination of culture • Kinnaird\'s (1946) truels • Axelrod and Bennett\'s (1993) model of competing bimodal coalitions • Joyce et al.\'s (2006) model of conditional association In particular, we explain how to characterise the transient and the asymptotic dynamics of these computer models and, where appropriate, how to assess the stochastic stability of their absorbing states. In all cases, the analysis conducted using the theory of Markov chains has yielded useful insights about the dynamics of the computer model under study.Computer Modelling, Simulation, Markov, Stochastic Processes, Analysis, Re-Implementation

    Evolutionary games on graphs

    Full text link
    Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first three sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fourth section surveys the topological complications implied by non-mean-field-type social network structures in general. The last three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.Comment: Review, final version, 133 pages, 65 figure

    Road Pricing with Autonomous Links

    Get PDF
    This research examines road pricing on a network of autonomous highway links. By autonomous it is meant that the links are competitive and independent, with the objective of maximizing their own profits without regard for either social welfare or the profits of other links. The principal goal of the research is to understand the implications of adoption of road pricing and privatization on social welfare and the distribution of gains and losses. The specific pricing strategies of autonomous links are evaluated first under the condition of competition for simple networks. An agent-based modeling system is developed which integrates an equilibrated travel demand, route choice, and travel time model with a repeated game of autonomous links setting prices to maximize profit. The levels of profit, welfare consequences, and potential cooperative arrangements undertaken by autonomous links will be evaluated. By studying how such an economic system may behave under various circumstances, the effectiveness of road pricing and road privatization as public policy can be assessed.Network dynamics, road pricing, autonomous links, privatization, agent-based transportation model
    corecore