Skip to main content
SpringerLink
Log in

Network structures between strategies in iterated prisoners’ dilemma games

  • Published:
Journal of the Korean Physical Society Aims and scope Submit manuscript

Abstract

We use replicator dynamics to study an iterated prisoners’ dilemma game with memory. In this study, we investigate the characteristics of all 32 possible strategies with a single-step memory by observing the results when each strategy encounters another one. Based on these results, we define similarity measures between the 32 strategies and perform a network analysis of the relationship between the strategies by constructing a strategies network. Interestingly, we find that a win-lose circulation, like rock-paper-scissors, exists between strategies and that the circulation results from one unusual strategy.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. M. Ruse, Monad to Man: The Concept of Progress in Evolutionary Biology (Harvard University Press, Harvard, 2009).

    Google Scholar 

  2. J. L. Hendrikse, T. E. Parsons and B. Hallgrímsson,, Evolution & Development 9, 393 (2007).

    Article  Google Scholar 

  3. R. Axelrod, The Complexity of Cooperation: Agentbased Models of Competition and Collaboration (Princeton University Press, Princeton, 1997).

    Google Scholar 

  4. K. Suchecki, V. M. Eguíluz and M. San Miguel, Phys. Rev. E 72, 36132 (2005).

    Article  ADS  Google Scholar 

  5. L. Giuggioli, S. Pérez-Becker and D. P. Sanders,, Phys. Rev. Lett. 110, 58103 (2013).

    Article  ADS  Google Scholar 

  6. M. Doebeli and C. Hauert, Ecol. Lett. 8, 748 (2005).

    Article  Google Scholar 

  7. R. Axelrod and W. D. Hamilton, Science 211, 1390 (1981).

    Article  ADS  MATH  MathSciNet  Google Scholar 

  8. G. Szabo and G. Fath, Phys. Rep. 446 (2007).

  9. J. Hofbauer and K. Sigmund, Evolutionary Games and Population Dynamics (Cambridge University Press, Cambridge, 1998).

    Book  MATH  Google Scholar 

  10. S. K. Baek and B. J. Kim, Phys. Rev. E 78, 011125 (2008).

    Article  ADS  MathSciNet  Google Scholar 

  11. A. Singhal, Modern Information Retrieval: A Brief Overview, IEEE Data Eng. Bull. 24, 35 (2001).

    Google Scholar 

  12. J. L. Rodgers and W. A. Nicewander, Amer. Stat. 42, 59 (1988).

    Article  Google Scholar 

  13. R. C. Prim, Shortest connection networks and some generalizations, Bell Syst. Tech. J. 36, 1389 (1957).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Physics, Hanyang University, Ansan, 426-791, Korea

    Young Jin Kim, Myungkyoon Roh & Seung-Woo Son

Authors
  1. Young Jin Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Myungkyoon Roh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Seung-Woo Son
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seung-Woo Son.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kim, Y.J., Roh, M. & Son, SW. Network structures between strategies in iterated prisoners’ dilemma games. Journal of the Korean Physical Society 64, 341–345 (2014). https://doi.org/10.3938/jkps.64.341

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3938/jkps.64.341

Keywords

Search

Navigation