The following article is Open access

Robustness of cooperation in the evolutionary prisoner's dilemma on complex networks

, , and

Published 28 June 2007 Published under licence by IOP Publishing Ltd
, , Focus on Complex Networked Systems: Theory and Application Citation J Poncela et al 2007 New J. Phys. 9 184 DOI 10.1088/1367-2630/9/6/184

1367-2630/9/6/184

Abstract

Recent studies on the evolutionary dynamics of the prisoner's dilemma game in scale-free networks have demonstrated that the heterogeneity of the network interconnections enhances the evolutionary success of cooperation. In this paper we address the issue of how the characterization of the asymptotic states of the evolutionary dynamics depends on the initial concentration of cooperators. We find that the measure and the connectedness properties of the set of nodes where cooperation reaches fixation is largely independent of initial conditions, in contrast with the behaviour of both the set of nodes where defection is fixed, and the fluctuating nodes. We also check for the robustness of these results when varying the degree heterogeneity along a one-parametric family of networks interpolating between the class of Erdős–Renyi graphs and the Barabási–Albert networks.

Export citation and abstract BibTeX RIS

Please wait… references are loading.