Robustness of cooperation in the evolutionary prisoner's dilemma on complex networks
Robustness of cooperation in the evolutionary prisoner's dilemma on complex networks
复制标题
DOI：
10.1088/1367-2630/9/6/184
复制
发表时间：
2007-06-28
影响因子：
3.3
通讯作者：
Moreno, Y.
中科院分区：
文献类型：
--
作者：
Poncela, J.;Gomez-Gardenes, J.;Moreno, Y.
近年来对无标度网络囚徒困境博弈进化动力学的研究表明，网络互联的异质性增强了合作的进化成功。在本文中，我们讨论了进化动力学的渐近状态的表征如何依赖于合作者的初始集中。我们发现合作达到固定的节点集的度量和连通性属性在很大程度上独立于初始条件，与背叛固定的节点集和波动节点的行为形成对比。在Erdos-Renyi图类和Barabasi-Albert网络之间插值的单参数网络族中，我们还检查了这些结果的鲁棒性。
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 Erdos-Renyi graphs and the Barabasi-Albert networks.