Phase diagrams for three-strategy evolutionary prisoner's dilemma games on regular graphs
Attila Szolnoki, Matjaz Perc, Gyorgy Szabo

TL;DR
This paper explores phase diagrams for three-strategy evolutionary prisoner's dilemma games on regular graphs, revealing complex phase transitions and the stabilizing role of tit-for-tat strategies across various parameters.
Contribution
It introduces a comprehensive analysis of phase transitions in three-strategy prisoner's dilemma games on regular graphs using simulations and pair approximation, highlighting the impact of costs and parameters.
Findings
Tit-for-tat prevents extinction of cooperators across all temptation values.
System exhibits oscillatory and stationary states depending on payoff parameters.
Repetitive cycles occur with parameter changes, showing high sensitivity of interactions.
Abstract
Evolutionary prisoner's dilemma games are studied with players located on square lattice and random regular graphs defining four neighbors for each one. The players follow one of the three strategies: tit-for-tat, unconditional cooperation, and defection. The simplified payoff matrix is characterized by two parameters: the temptation to choose defection, and the cost of inspection reducing the income of tit-for-tat. The strategy imitation from one of the neighbors is controlled by pairwise comparison at a fixed level of noise. Using Monte Carlo simulations and the extended versions of pair approximation we have evaluated the phase diagrams indicating a rich plethora of phase transitions between stationary coexistence, absorbing and oscillatory states, including continuous and discontinuous phase transitions. By reasonable costs the tit-for-tat strategy prevents extinction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
