Network-based criterion for the success of cooperation in an evolutionary prisoner's dilemma

Abstract

We consider an evolutionary prisoner's dilemma on a random network. We introduce a simple quantitative network-based parameter and show that it effectively predicts the success of cooperation in simulations on the network. The criterion is shown to be accurate on a variety of networks with degree distributions ranging from regular to Poisson to scale free. The parameter allows for comparisons of random networks regardless of their underlying topology. Finally, we draw analogies between the criterion for the success of cooperation introduced here and existing criteria in other contexts.