Skip to main content

The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating

  • Conference paper
  • First Online:
Algorithms and Models for the Web Graph (WAW 2016)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10088))

Included in the following conference series:

  • 494 Accesses

Abstract

The Prisoner’s Dilemma Process on a graph is an iterative process where each vertex, with a fixed strategy (cooperate or defect), plays the game with each of its neighbours. At the end of a round each vertex may change its strategy to that of its neighbour with the highest pay-off. Here we study the spread of cooperative and selfish behaviours on a toroidal grid, where each vertex is initially a cooperator with probability p. When vertices are permitted to change their strategies via a randomized asynchronous update scheme, we find that for some values of p the limiting ratio of cooperators may be modelled as a polynomial in p. Theoretical bounds for this ratio are confirmed via simulation.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. On-line encyclopaedia of integer sequences https://oeis.org, sequence A001168

  2. Choi, H., Kim, S.H., Lee, J.: Role of network structure and network effects in diffusion of innovations. Ind. Mark. Manage. 39(1), 170–177 (2010)

    Article  Google Scholar 

  3. Weerd, H., Verbrugge, R.: Evolution of altruistic punishment in heterogeneous populations. J. Theor. Biol. 290, 88–103 (2011)

    Article  MathSciNet  Google Scholar 

  4. Duffy, C., Janssen, J.: The prisoners dilemma on toroidal grids (2016). http://www.mathstat.dal.ca/ cduffy/PD, electronic resource

  5. Gibbons, R.: Game theory for applied economists. Princeton University Press, Princeton (1992)

    Google Scholar 

  6. Nicosia, V., Bagnoli, F., Latora, V.: Impact of network structure on a model of diffusion and competitive interaction. EPL (Europhys. Lett.) 94(6), 68009 (2011)

    Article  Google Scholar 

  7. Nowak, M.A., May, R.M.: The spatial dilemmas of evolution. Int. J. Bifurcat. Chaos 3(01), 35–78 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  8. Schönfisch, B., Roos, A.: Synchronous and asynchronous updating in cellular automata. BioSystems 51(3), 123–143 (1999)

    Article  Google Scholar 

  9. Sigmund, K., Nowak, M.: Cooperation in heterogeneous populations. In: Fischer, G.H., Laming, D. (eds.) Contributions to Mathematical Psychology, Psychometrics, and Methodology. Recent Research in Psychology, pp. 223–235. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  10. Szabó, G., Fáth, G.: Evolutionary games on graphs. Phys. Rep. 446(46), 97–216 (2007)

    Article  MathSciNet  Google Scholar 

  11. Szabó, G., Vukov, J., Szolnoki, A.: Phase diagrams for an evolutionary prisoners dilemma game on two-dimensional lattices. Phys. Rev. E 72(4), 047107 (2005)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christopher Duffy .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Duffy, C., Janssen, J. (2016). The Spread of Cooperative Strategies on Grids with Random Asynchronous Updating. In: Bonato, A., Graham, F., Prałat, P. (eds) Algorithms and Models for the Web Graph. WAW 2016. Lecture Notes in Computer Science(), vol 10088. Springer, Cham. https://doi.org/10.1007/978-3-319-49787-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-49787-7_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-49786-0

  • Online ISBN: 978-3-319-49787-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics