351 research outputs found

    Interdependent network reciprocity in evolutionary games

    Get PDF
    Besides the structure of interactions within networks, also the interactions between networks are of the outmost importance. We therefore study the outcome of the public goods game on two interdependent networks that are connected by means of a utility function, which determines how payoffs on both networks jointly influence the success of players in each individual network. We show that an unbiased coupling allows the spontaneous emergence of interdependent network reciprocity, which is capable to maintain healthy levels of public cooperation even in extremely adverse conditions. The mechanism, however, requires simultaneous formation of correlated cooperator clusters on both networks. If this does not emerge or if the coordination process is disturbed, network reciprocity fails, resulting in the total collapse of cooperation. Network interdependence can thus be exploited effectively to promote cooperation past the limits imposed by isolated networks, but only if the coordination between the interdependent networks is not disturbe

    Games on Cellular Spaces: How Mobility Affects Equilibrium

    Get PDF
    In this work we propose a new model for spatial games. We present a definition of mobility in terms of the satisfaction an agent has with its spatial location. Agents compete for space through a non-cooperative game by using mixed strategies. We are particularly interested in studyig the relation between Nash equilibrium and the winner strategy of a given model with mobility, and how the mobility can affect the results. The experiments show that mobility is an important variable concerning spatial games. When we change parameters that affect mobility, it may lead to the success of strategies away from Nash equilibrium.Spatial Games, Agent-Based Modelling, Mobility, Satisfaction, Chicken Game, Nash Equilibrium

    A Spatial Agent-Based Model of N-Person Prisoner's Dilemma Cooperation in a Socio-Geographic Community

    Get PDF
    The purpose of this paper is to present a spatial agent-based model of N-person prisoner's dilemma that is designed to simulate the collective communication and cooperation within a socio-geographic community. Based on a tight coupling of REPAST and a vector Geographic Information System, the model simulates the emergence of cooperation from the mobility behaviors and interaction strategies of citizen agents. To approximate human behavior, the agents are set as stochastic learning automata with Pavlovian personalities and attitudes. A review of the theory of the standard prisoner's dilemma, the iterated prisoner's dilemma, and the N-person prisoner's dilemma is given as well as an overview of the generic architecture of the agent-based model. The capabilities of the spatial N-person prisoner's dilemma component are demonstrated with several scenario simulation runs for varied initial cooperation percentages and mobility dynamics. Experimental results revealed that agent mobility and context preservation bring qualitatively different effects to the evolution of cooperative behavior in an analyzed spatial environment.Agent Based Modeling, Cooperation, Prisoners Dilemma, Spatial Interaction Model, Spatially Structured Social Dilemma, Geographic Information Systems

    Simulating Evolutionary Games: A Python-Based Introduction

    Get PDF
    This paper is an introduction to agent-based simulation using the Python programming language. The core objective of the paper is to enable students, teachers, and researchers immediately to begin social-science simulation projects in a general purpose programming language. This objective is facilitated by design features of the Python programming language, which we very briefly discuss. The paper has a 'tutorial' component, in that it is enablement-focused and therefore strongly application-oriented. As our illustrative application, we choose a classic agent-based simulation model: the evolutionary iterated prisoner's dilemma. We show how to simulate the iterated prisoner's dilemma with code that is simple and readable yet flexible and easily extensible. Despite the simplicity of the code, it constitutes a useful and easily extended simulation toolkit. We offer three examples of this extensibility: we explore the classic result that topology matters for evolutionary outcomes, we show how player type evolution is affected by payoff cardinality, and we show that strategy evaluation procedures can affect strategy persistence. Social science students and instructors should find that this paper provides adequate background to immediately begin their own simulation projects. Social science researchers will additionally be able to compare the simplicity, readability, and extensibility of the Python code with comparable simulations in other languages.Agent-Based Simulation, Python, Prisoner's Dilemma

    Social Preference, Incomplete Information, and the Evolution of Ultimatum Game in the Small World Networks: An Agent-Based Approach

    Get PDF
    Certain social preference models have been proposed to explain fairness behavior in experimental games. Existing bodies of research on evolutionary games, however, explain the evolution of fairness merely through the self-interest agents. This paper attempts to analyze the ultimatum game's evolution on complex networks when a number of agents display social preference. Agents' social preference is modeled in three forms: fairness consideration or maintaining a minimum acceptable money level, inequality aversion, and social welfare preference. Different from other spatial ultimatum game models, the model in this study assumes that agents have incomplete information on other agents' strategies, so the agents need to learn and develop their own strategies in this unknown environment. Genetic Algorithm Learning Classifier System algorithm is employed to address the agents' learning issue. Simulation results reveal that raising the minimum acceptable level or including fairness consideration in a game does not always promote fairness level in ultimatum games in a complex network. If the minimum acceptable money level is high and not all agents possess a social preference, the fairness level attained may be considerably lower. However, the inequality aversion social preference has negligible effect on the results of evolutionary ultimatum games in a complex network. Social welfare preference promotes the fairness level in the ultimatum game. This paper demonstrates that agents' social preference is an important factor in the spatial ultimatum game, and different social preferences create different effects on fairness emergence in the spatial ultimatum game.Spatial Ultimatum Game, Complex Network, Social Preference, Agent Based Modeling

    Cooperation in Networked Populations of Selfish Adaptive Agents: Sensitivity to Learning Speed

    Get PDF
    This paper investigates the evolution of cooperation in iterated Prisoner's Dilemma (IPD) games with individually learning agents, subject to the structure of the interaction network. In particular, we study how Tit-for-Tat or All-Defection comes to dominate the population on Watts-Strogatz networks, under varying learning speeds and average network path lengths. We find that the presence of a cooperative regime (where almost the entire population plays Tit-for-Tat) is dependent on the quickness of information spreading across the network. More precisely, cooperation hinges on the relation between individual adaptation speed and average path length in the interaction topology. Our results are in good agreement with previous works both on discrete choice dynamics on networks and in the evolution of cooperation literature

    Evolutionary Games in Complex Topologies: Interplay between Structure and Dynamics

    Get PDF
    En este estudio exploramos la interrelación entre la estructura subyacente de una cierta población de individuos y el resultado de la dinámica que está teniendo lugar en ella, específicamente, el Dilema del Prisionero. En la primera parte de este trabajo analizamos el caso de una topología estática, en la que la red de conexiones no cambia en el tiempo. En la segunda parte, desarrollamos dos modelos para crecer redes, donde dicho crecimiento esta íntimamente relacionado con la dinámica
    corecore