arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1205.0802q-bio.PEcond-mat.stat-mechphysics.soc-ph
收藏

赢-留-输-学促进空间囚徒困境博弈中的合作

Win-stay-lose-learn promotes cooperation in the spatial prisoner's dilemma game

Yongkui Liu, Xiaojie Chen, Lin Zhang, Long Wang, Matjaz Perc

摘要:

坚持自己的战略是自然和常见的,如果后者保证成功和满意。这与进化博弈的普遍模拟实践相违背,在进化博弈中,参与者经常考虑改变他们的策略,即使他们的收益可能与其他参与者略有不同。受此启发,我们引入了一个基于抱负的赢-留-输-学策略更新规则的空间囚徒困境游戏。该规则简单直观,不满意的参与者只会改变策略,然后尝试采用他们最近邻居的策略,而满意的参与者的策略不会改变。我们发现,建议的赢-留-输-学习规则促进了合作的演变,它这样做非常强大,独立的初始条件。事实上,我们表明,即使是一分钟的初始分数的合作者可能足以最终确保一个高度合作的最终状态。除了广泛的模拟结果,支持我们的结论,我们还提出了通过对所研究的游戏近似得到的结果。我们的研究结果延续了相关赢留策略更新规则的成功故事,并通过这样做揭示了解决囚犯困境的新方法。

英文摘要:

Holding on to one's strategy is natural and common if the later warrants success and satisfaction. This goes against widespread simulation practices of evolutionary games, where players frequently consider changing their strategy even though their payoffs may be marginally different than those of the other players. Inspired by this observation, we introduce an aspiration-based win-stay-lose-learn strategy updating rule into the spatial prisoner's dilemma game. The rule is simple and intuitive, foreseeing strategy changes only by dissatisfied players, who then attempt to adopt the strategy of one of their nearest neighbors, while the strategies of satisfied players are not subject to change. We find that the proposed win-stay-lose-learn rule promotes the evolution of cooperation, and it does so very robustly and independently of the initial conditions. In fact, we show that even a minute initial fraction of cooperators may be sufficient to eventually secure a highly cooperative final state. In addition to extensive simulation results that support our conclusions, we also present results obtained by means of the pair approximation of the studied game. Our findings continue the success story of related win-stay strategy updating rules, and by doing so reveal new ways of resolving the prisoner's dilemma.

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

↑