Convergence of the Iterated Prisoner's Dilemma Game

Authors:
Martin Dyer;Leslie Ann Goldberg;Catherine Greenhill;Gabriel Istrate;Mark Jerrum
Affiliations:
School of Computing, University of Leeds, Leeds LS2 9JT, United Kingdom (e-mail: dyer@comp.leeds.ac.uk);Department of Computer Science, University of Warwick, Coventry CV4 7AL, United Kingdom (e-mail: leslie@dcs.warwick.ac.uk);Department of Mathematics and Statistics, University of Melbourne, Parkville VIC 3502, Australia (e-mail: csg@ms.unimelb.edu.au);Center for Nonlinear Science and CIC-3 Division, Los Alamos National Laboratory, Mail Stop B258, Los Alamos, NM 87545, USA (e-mail: istrate@lanl.gov);School of Computer Science, University of Edinburgh, King's Building, Edinburgh EH9 3JZ, United Kingdom (e-mail: mrj@dcs.ed.ac.uk)
Venue:
Combinatorics, Probability and Computing
Year:
2002

Citing 5
Cited 9

Approximately counting up to four (extended abstract)

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the emergence of social conventions: modeling, analysis, and simulations

Artificial Intelligence - Special issue on economic principles of multi-agent systems
Mixing properties of the Swendsen-Wang process on classes of graphs

Random Structures & Algorithms - Special issue on statistical physics methods in discrete probability, combinatorics, and theoretical computer science
On Markov chains for independent sets

Journal of Algorithms
Markov chain algorithms for planar lattice structures

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Coupling and self-stabilization

Distributed Computing - Special issue: DISC 04
On the expected time for Herman's probabilistic self-stabilizing algorithm

Theoretical Computer Science
Slow emergence of cooperation for win-stay lose-shift on trees

Machine Learning
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)

Fundamenta Informaticae - Machines, Computations and Universality, Part II
On the computational capabilities of several models

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Stochastic minority on graphs

Theoretical Computer Science
Computing with pavlovian populations

OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
On the Dynamics of Social Balance on General Networks (with an application to XOR-SAT)

Fundamenta Informaticae - Machines, Computations and Universality, Part II
Adversarial scheduling in discrete models of social dynamics

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a stochastic process based on the iterated prisoner's dilemma game. During the game, each of n players has a state, either cooperate or defect. The players are connected by an ‘interaction graph’. During each step of the process, an edge of the graph is chosen uniformly at random and the states of the players connected by the edge are modified according to the Pavlov strategy. The process converges to a unique absorbing state in which all players cooperate. We prove two conjectures of Kittock: the convergence rate is exponential in n when the interaction graph is a complete graph, and it is polynomial in n when the interaction graph is a cycle. In fact, we show that the rate is O(n log n) in the latter case.