Abstract
We investigate the evolution of cooperation in the prisoner’s dilemma on different types of interaction networks. Agents interact with their network neighbours. An agent is classified by a value S ∈ [ − 1,1] denoting its strategy and by its image score. It will cooperate if the opponents relative image score is above S and defect otherwise. Agents spread their strategies to their network neighbours proportionally to payoff differences. We find that network topology strongly influences the average cooperation rate; networks with low degree variance allowing for the largest amount of cooperation. In heterogeneous networks an agents place in the network strongly influences its strategy. Thus, agents on hub nodes are found to ‘police’ the population, while being on low degree nodes tends to favour over-generous less discriminating strategies.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Hammerstein, P. (ed.): Genetic and Cultural Evolution of Cooperation. MIT Press, Cambridge (2003)
Richerson, P.J., Boyd, R., Henrich, J.: The Cultural Evolution of Human Cooperation. In: Hammerstein, P. (ed.) The Genetic and Cultural Evolution of Cooperation, pp. 357–388. MIT Press, Cambridge (1999)
Nowak, M.A., Sigmund, K.: Evolution of Indirect Reciprocity by Image Scoring. Nature 393, 573–577 (1996)
Wedekind, C., Milinski, M.: Cooperation Through Image Scoring in Humans. Science 280, 850–852 (2000)
Axelrod, R., Hamilton, W.D.: The Evolution of Cooperation. Science 211, 1390 (1981)
Albert, R., Barabási, A.L.: Statistical Mechanics of Complex Networks. Rev. Mod. Phys. 74, 47–97 (2002)
Nowak, M.A., May, R.M.: Evolutionary Games and Spatial Chaos. Nature 359, 826–829 (1992)
Santos, F.C., Pacheco, J.M.: Scale-Free Networks Provide a Unifying Framework for the Emergence of Cooperation. Phys. Rev. Lett. 95, 098104 (2005)
Santos, F.C., Pacheco, J.M., Lenaerts, T.: Evolutionary Dynamics of Social Dilemmas in Structured Homogeneous Populations. Proc. Natl. Sci. USA 103, 3490–3494 (2006)
Santos, F.C., Rodrigues, J.F., Pacheco, J.M.: Graph Topology Plays a Determinant Role in the Evolution of Cooperation. Proc. R. Soc. B 273, 51–55 (2006)
Ohtsuki, H., Hauert, C., Nowak, M.A.: A simple rule for the evolution of cooperation on graphs. Nature 441, 502–505 (2006)
Taylor, P.D., Day, T., Wild, G.: Evolution of Cooperation in a Finit Homogeneous Graph. Nature 447, 469–472 (2007)
Gintis, H.: Game Theory Evolving. Princeton University Press, Princeton NJ (2000)
Barabási, A.L., Albert, R.: Emergence of Scaling in Random Networks. Science 286, 509–512 (1999)
Erdös, P., Rényi, A.: On Random Graphs I. Publicationes Mathematicae. Debrecen 6, 290–297 (1959)
Wormwald, N.D.: Models of Random Regular Graphs. In: Lambd, J.D., Preece, D.A. (eds.) London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge (1999)
Newth, D., Brede, M.: Fitness Landscape Analysis and Optimization of Coupled Oscillators. Complex Systems 16, 317–331 (2006)
Pecora, L.M., Carroll, T.L.: Master Stability Function for Synchronized Coupled Systems. Phys. Rev. Lett. 80(10), 2109–2112 (1998)
Ohtsuki, H., Iwasa, Y.: The leading eight: Social norms that can maintain cooperation by indirect reciprocity. Journal of Theoretical Biology 239(4), 435–444 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Brede, M. (2007). The Prisoner’s Dilemma with Image Scoring on Networks: How Does a Player’s Strategy Depend on Its Place in the Social Network?. In: Randall, M., Abbass, H.A., Wiles, J. (eds) Progress in Artificial Life. ACAL 2007. Lecture Notes in Computer Science(), vol 4828. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76931-6_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-76931-6_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-76930-9
Online ISBN: 978-3-540-76931-6
eBook Packages: Computer ScienceComputer Science (R0)