arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv physics/0612108physics.soc-ph
收藏

复杂拓扑中的动态协作组织

Dynamical Organization of Cooperation in Complex Topologies

J. Gomez-Gardenes, M. Campillo, L. M. Floria, Y. Moreno

摘要:

在这封信中,我们研究合作是如何组织在复杂的拓扑结构,通过分析进化(复制)动力学的囚徒困境,两个球员的游戏有两个可用的策略,背叛和合作,其回报矩阵有利于背叛。我们发现,渐近,人口被划分为三个子集:个人总是合作({ \em纯合作者}),总是缺陷({ \em纯叛逃者})和那些间歇性地改变他们的策略。事实上,后一组的大小是最大的范围内的“刺激缺陷”参数。在齐次随机图中,纯合作者被分成几个簇,而在异质无标度(SF)网络中,它们总是形成一个包含最多连接个体(枢纽)的单一簇。我们的研究结果提供了进一步的见解,为什么在SF网络合作的青睐。

英文摘要:

In this Letter, we study how cooperation is organized in complex topologies by analyzing the evolutionary (replicator) dynamics of the Prisoner's Dilemma, a two-players game with two available strategies, defection and cooperation, whose payoff matrix favors defection. We show that, asymptotically, the population is partitioned into three subsets: individuals that always cooperate ({\em pure cooperators}), always defect ({\em pure defectors}) and those that intermittently change their strategy. In fact the size of the latter set is the biggest for a wide range of the "stimulus to defect" parameter. While in homogeneous random graphs pure cooperators are grouped into several clusters, in heterogeneous scale-free (SF) networks they always form a single cluster containing the most connected individuals (hubs). Our results give further insights into why cooperation in SF networks is favored.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑