Suppr超能文献

复杂网络博弈中的合作条件。

A condition for cooperation in a game on complex networks.

机构信息

The Institute of Industrial Science, The University of Tokyo, and Research Fellow of the Japan Society for the Promotion of Science, Komaba 4-6-1, Meguro, Tokyo 153-8505, Japan.

出版信息

J Theor Biol. 2011 Jan 21;269(1):224-33. doi: 10.1016/j.jtbi.2010.10.033. Epub 2010 Oct 31.

Abstract

We study a condition of favoring cooperation in Prisoner's Dilemma game on complex networks. There are two kinds of players: cooperators and defectors. Cooperators pay a benefit b to their neighbors at a cost c, whereas defectors only receive a benefit. The game is a death-birth process with weak selection. Although it has been widely thought that b/c>〈k〉 is a condition of favoring cooperation (Ohtsuki et al., 2006), we find that b/c>〈k(nn)〉 is the condition. We also show that among three representative networks, namely, regular, random, and scale-free, a regular network favors cooperation the most, whereas a scale-free network favors cooperation the least. In an ideal scale-free network, cooperation is never realized. Whether or not the scale-free network and network heterogeneity favor cooperation depends on the details of the game, although it is occasionally believed that these favor cooperation irrespective of the game structure.

摘要

我们研究了复杂网络中囚徒困境博弈中有利于合作的条件。有两种类型的玩家:合作者和背叛者。合作者以成本 c 向邻居支付收益 b,而背叛者只获得收益。游戏是一个具有弱选择的生死过程。尽管人们普遍认为 b/c>〈k〉是有利于合作的条件(Ohtsuki 等人,2006),但我们发现 b/c>〈k(nn)〉才是条件。我们还表明,在三种有代表性的网络中,即规则、随机和无标度网络中,规则网络最有利于合作,而无标度网络最不利于合作。在理想的无标度网络中,合作永远不会实现。无标度网络和网络异质性是否有利于合作取决于游戏的细节,尽管人们有时认为无论游戏结构如何,这些都有利于合作。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验