pith. sign in

arxiv: cond-mat/0208478 · v1 · submitted 2002-08-26 · ❄️ cond-mat.dis-nn · cond-mat.stat-mech

Evolutionary prisoner's dilemma games with optional participation

classification ❄️ cond-mat.dis-nn cond-mat.stat-mech
keywords graphsrandomregularapproximationbehaviorconnectivitycyclicdilemma
0
0 comments X
read the original abstract

Competition among cooperators, defectors, and loners is studied in an evolutionary prisoner's dilemma game with optional participation. Loners are risk averse i.e. unwilling to participate and rather rely on small but fixed earnings. This results in a rock-scissors-paper type cyclic dominance of the three strategies. The players are located either on square lattices or random regular graphs with the same connectivity. Occasionally, every player reassesses its strategy by sampling the payoffs in its neighborhood. The loner strategy efficiently prevents successful spreading of selfish, defective behavior and avoids deadlocks in states of mutual defection. On square lattices, Monte Carlo simulations reveal self-organizing patterns driven by the cyclic dominance, whereas on random regular graphs different types of oscillatory behavior are observed: the temptation to defect determines whether damped, periodic or increasing oscillations occur. These results are compared to predictions by pair approximation. Although pair approximation is incapable of distinguishing the two scenarios because of the equal connectivity, the average frequencies as well as the oscillations on random regular graphs are well reproduced.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.