Games and nets literature review
From Santa Fe Institute Events Wiki
Ohtsuki, H., Hauert, C., Lieberman, E. & Nowak, M.A. A simple rule for the evolution of cooperation on graphs and social networks. Nature 441: 502-505 (2006). pdf
This is a simple exploration of how network structure -- in particular, connectedness -- affects the evolution of cooperation. They find that a good predictor for whether cooperation can invade and spread in a network is whether the benefit-cost ratio is greater than the (average) degree of the graph. They derive the result exactly for a cycle, approximately for a random graph where every node has the same degree, and use simulation to show that the fit is good for true random graphs and scale-free networks.
Back to games and nets group