Skip to main content

Prisoner’s Dilemma Game on Network

  • Conference paper
Multi-Agent Systems for Society (PRIMA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4078))

Included in the following conference series:

  • 531 Accesses

Abstract

We study on the Prisoner’s Dilemma game on network to clarify the influence of the network structures on agent strategies, and vice versa. A model is proposed to treat an interaction between the agent strategies and the network formation process. In case of a fixed network, it is observed that the distribution as well as the propagation speed of an agent strategy depends on the network structure. In an experiment combining the agent evolution and the network formation, a novel network that has a few agents connected by all of other agents appears.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Nowak, M.A., May, R.M.: Evolutionary games and spatial chaos. Nature 359, 826–829 (1992)

    Article  Google Scholar 

  2. Lindgren, K., Nordahl, M.G.: Evolutionary dynamics of spatial games. Physica D 75, 292–309 (1994)

    Article  MATH  Google Scholar 

  3. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

  4. Watts, D.J.: Small Worlds. Princeton University Press, Princeton (1999)

    Google Scholar 

  5. Abramson, G., Kuperman, M.: Social games in a social network. Physical Review E (2001)

    Google Scholar 

  6. Masuda, N., Aihara, K.: Spatial prisoner’s dilemma optimally played in small-world networks. Physics Letters A 313, 55–61 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  7. Barabasi, A., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Bala, V., Goyal, S.: A noncooperative model of network formation. Econometrica (2000)

    Google Scholar 

  9. Axelrod, R.: The Evolution of Cooperation. Basic Books (1985)

    Google Scholar 

  10. Nowak, M.A., Sigmund, K.: A strategy of win-stay, lose-shift that outperforms tit-for-tat in the prisoner’s dilemma game. Nature 364, 56–58 (1993)

    Article  Google Scholar 

  11. Lindgren, K.: Evolutionary phenomena in simple dynamics. In: Artificial Life II: Proceedings of the Workshop on Artificial Life held, Santa Fe, New Mexico, February 1990, pp. 295–312 (1992)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ono, M., Ishizuka, M. (2009). Prisoner’s Dilemma Game on Network. In: Lukose, D., Shi, Z. (eds) Multi-Agent Systems for Society. PRIMA 2005. Lecture Notes in Computer Science(), vol 4078. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03339-1_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03339-1_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03337-7

  • Online ISBN: 978-3-642-03339-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics