Direct reciprocity on graphs.

J Theor Biol

Department of Biology, Faculty of Sciences, Kyushu University, Fukuoka 812-8581, Japan.

Published: August 2007

Direct reciprocity is a mechanism for the evolution of cooperation based on the idea of repeated encounters between the same two individuals. Here we examine direct reciprocity in structured populations, where individuals occupy the vertices of a graph. The edges denote who interacts with whom. The graph represents spatial structure or a social network. For birth-death or pairwise comparison updating, we find that evolutionary stability of direct reciprocity is more restrictive on a graph than in a well-mixed population, but the condition for reciprocators to be advantageous is less restrictive on a graph. For death-birth and imitation updating, in contrast, both conditions are easier to fulfill on a graph. Moreover, for all four update mechanisms, reciprocators can dominate defectors on a graph, which is never possible in a well-mixed population. We also study the effect of an error rate, which increases with the number of links per individual; interacting with more people simultaneously enhances the probability of making mistakes. We provide analytic derivations for all results.

Download full-text PDF

Source
http://www.ncbi.nlm.nih.gov/pmc/articles/PMC2376797PMC
http://dx.doi.org/10.1016/j.jtbi.2007.03.018DOI Listing

Publication Analysis

Top Keywords

direct reciprocity
16
restrictive graph
8
graph well-mixed
8
well-mixed population
8
graph
6
direct
4
reciprocity graphs
4
graphs direct
4
reciprocity mechanism
4
mechanism evolution
4

Similar Publications

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!