Direct reciprocity on graphs.
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.
Ohtsuki
Hisashi
H
Department of Biology, Faculty of Sciences, Kyushu University, Fukuoka 812-8581, Japan. ohtsuki@bio-math10.biology.kyushu-u.ac.jp
Nowak
Martin A
MA
D000818:Animals; D003299:Cooperative Behavior; D003468:Cultural Evolution; D006801:Humans; D008954:Models, Biological; D011157:Population Dynamics; D012919:Social Behavior; D013223:Statistics as Topic