skip to main content
10.1145/2090236.2090256acmconferencesArticle/Chapter ViewAbstractPublication PagesitcsConference Proceedingsconference-collections
research-article

Dynamics of prisoner's dilemma and the evolution of cooperation on networks

Published:08 January 2012Publication History

ABSTRACT

We study the evolution of cooperation in populations where individuals play prisoner's dilemma on a network. Every node of the network corresponds to an individual choosing whether to cooperate or defect in a repeated game. The players revise their actions by imitating those neighbors who have higher payoffs.

We show that when the interactions take place on graphs with large girth, cooperation is more likely to emerge. On the flip side, in graphs with many cycles of length 3 and 4, defection spreads more rapidly.

One of the key ideas of our analysis is that our dynamics can be seen as a perturbation of the voter model. We write the transition kernel of the corresponding Markov chain in terms of the pairwise correlations in the voter model. We analyze the pairwise correlation and show that in graphs with relatively large girth, cooperators cluster and help each other.

References

  1. D. Aldous and J. A. Fill. Reversible Markov Chains and Random Walks on Graphs. 1994.Google ScholarGoogle Scholar
  2. C. Alós-Ferrer and S. Weidenholzer. Contagion and efficiency. Journal of Economic Theory, 143(1):251--274, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  3. P. Donnelly and D. Welsh. Finite particle systems and infection models. Mathematical Proceedings of the Cambridge Philosophical Society, 94:167--182, 1983.Google ScholarGoogle ScholarCross RefCross Ref
  4. G. Ellison. Cooperation in the prisoner's dilemma with anonymous random matching. The Review of Economic Studies, 61(3):567--588, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  5. I. Eshel, L. Samuelson, and A. Shaked. Altruists, egoists, and hooligans in a local interaction model. The American Economic Review, 88(1):157--179, 1998.Google ScholarGoogle Scholar
  6. I. Eshel, E. Sansone, and A. Shaked. Evolutionary dynamics of populations with a local interaction structure, mimeo, 1996.Google ScholarGoogle Scholar
  7. D. Fudenberg, D. Levine, and E. Maskin. The folk theorem with imperfect public information. Econometrica, 62(5):997--1039, 1994.Google ScholarGoogle ScholarCross RefCross Ref
  8. D. Fundenberg and E. Maskin. Evolution and cooperation in noisy repeated games. The American Economic Review, 8(2):274--279, 1990.Google ScholarGoogle Scholar
  9. T. M. Liggett. Interacting Particle Systems. Springer, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  10. M. A. Nowak. Five rules for the evolution of cooperation. Science 314, pages 1560--1563, 2006.Google ScholarGoogle Scholar
  11. M. A. Nowak, A. Sasaki, C. Taylor, and D. Fudenberg. Emergence of cooperation and evolutionary stability in finite populations. Nature 428, pages 646--650, 2004.Google ScholarGoogle Scholar
  12. H. Ohtsuki, C. Hauert, and E. Lieberman, and M. A. Nowak. A simple rule for the evolution of cooperation on graphs and social networks. Nature 441, pages 502--505, 2006.Google ScholarGoogle Scholar
  13. A. V. Outkin. Cooperation and local interactions in the prisoners' dilemma game. Journal of Economic Behavior Organization, 52(4):481--503, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  14. J. Palacios and P. Tetali. A note on expected hitting times for birth and death chains. Statistics & Probability Letters, 30(2):119--125, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  15. W. H. Sandholm. Population Games and Evolutionary Dynamics (Series on Economic Learning and Social Evolution). MIT Press, 2011.Google ScholarGoogle Scholar
  16. G. Szabó and G. Fáth. Evolutionary games on graphs. Physics Reports, 446:97--216, 2007.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Dynamics of prisoner's dilemma and the evolution of cooperation on networks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ITCS '12: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
          January 2012
          516 pages
          ISBN:9781450311151
          DOI:10.1145/2090236

          Copyright © 2012 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 8 January 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          ITCS '12 Paper Acceptance Rate39of93submissions,42%Overall Acceptance Rate172of513submissions,34%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader