Related papers: Prisoner's dilemma on dynamic networks under perfe…
We address the problem of how the survival of cooperation in a social system depends on the motion of the individuals. Specifically, we study a model in which Prisoner's Dilemma players are allowed to move in a two-dimensional plane. Our…
The prisoner's dilemma (PD) is a game-theoretic model studied in a wide array of fields to understand the emergence of cooperation between rational self-interested agents. In this work, we formulate a spatial iterated PD as a discrete-event…
Here we study the effects of adopting different strategies against different opponent instead of adopting the same strategy against all of them in the prisoner dilemma structured in well-mixed populations. We consider an evolutionary…
In this work, we investigate a model of an adaptive networked dynamical system, where the coupling strengths among phase oscillators coevolve with the phase states. It is shown that in this model the oscillators can spontaneously…
It has been an old unsolved puzzle to evolutionary theorists on which mechanisms would increase large-scale cooperation in human societies. Thus, how such mechanisms operate in a biological network is still not very understood. This study…
Heterogeneity has been studied as one of the most common explanations of the puzzle of cooperation in social dilemmas. A large number of papers have been published discussing the effects of increasing heterogeneity in structured populations…
We investigate the spatial distribution and the global frequency of agents who can either cooperate or defect. The agent interaction is described by a deterministic, non-iterated prisoner's dilemma game, further each agent only locally…
The structure of social networks is a key determinant in fostering cooperation and other altruistic behavior among naturally selfish individuals. However, most real social interactions are temporal, being both finite in duration and spread…
We study environments in which agents are randomly matched to play a Prisoner's Dilemma, and each player observes a few of the partner's past actions against previous opponents. We depart from the existing related literature by allowing a…
Recent research has identified interactions between networks as crucial for the outcome of evolutionary games taking place on them. While the consensus is that interdependence does promote cooperation by means of organizational complexity…
A new approach for the study of social games and communications is proposed. Games are simulated between cognitive players who build the opponent's internal model and decide their next strategy from predictions based on the model. In this…
As an important psychological and social experiment, the Iterated Prisoner's Dilemma (IPD) treats the choice to cooperate or defect as an atomic action. We propose to study the behaviors of online learning algorithms in the Iterated…
The Prisoner's Dilemma Process on a graph $G$ is an iterative process where each vertex, with a fixed strategy (cooperate or defect), plays the game with each of its neighbours. At the end of a round each vertex may change its strategy to…
The spatial Prisoner's Dilemma is a prototype model to show the emergence of cooperation in very competitive environments. It considers players, at site of lattices, that can either cooperate or defect when playing the Prisoner's Dilemma…
In this paper we address the cooperation problem in structured populations by considering the prisoner's dilemma game as metaphor of the social interactions between individuals with imitation capacity. We present a new strategy update rule…
The interplay of social and strategic motivations in human interactions is a largely unexplored question in collective social phenomena. Whether individuals' decisions are taken in a pure strategic basis or due to social pressure without a…
We study the transition towards effective payoffs in the prisoner's dilemma game on scale-free networks by introducing a normalization parameter guiding the system from accumulated payoffs to payoffs normalized with the connectivity of each…
We study population dynamics under which each revising agent tests each strategy k times, with each trial being against a newly drawn opponent, and chooses the strategy whose mean payoff was highest. When k = 1, defection is globally stable…
In a recent Letter [F.C. Santos and J. M. Pacheco Phys. Rev. Lett. \textbf{95}, 098104 (2005)], the scale-free networks are found to be advantageous for the emergence of cooperation. In the present work an evolutionary prisoner's dilemma…
We present an extensive, systematic study of the Prisoner's Dilemma and Snowdrift games on a square lattice under a synchronous, noiseless imitation dynamics. We show that for both the occupancy of the network and the (random) mobility of…