論文

2021年1月

Friendly-rivalry solution to the iterated n-person public-goods game

PLOS COMPUTATIONAL BIOLOGY
  • Yohsuke Murase
  • ,
  • Seung Ki Baek

17
1
記述言語
英語
掲載種別
研究論文(学術雑誌)
DOI
10.1371/journal.pcbi.1008217
出版者・発行元
PUBLIC LIBRARY SCIENCE

Author summaryHow to maintain cooperation among a number of self-interested individuals is a difficult problem, especially if they can sometimes commit error. In this work, we propose a strategy for the iterated n-person public-goods game based on the following five rules: Cooperate if everyone did, accept punishment for your own mistake, punish others' defection, recover cooperation if you find a chance, and defect in all the other circumstances. These rules are not far from actual human behavior, and the resulting strategy guarantees three advantages: First, if everyone uses it, full cooperation is recovered even if error occurs with small probability. Second, the player of this strategy always never obtains a lower long-term payoff than any of the co-players. Third, if the co-players are unconditional cooperators, it obtains a strictly higher long-term payoff than theirs. Therefore, if everyone uses this strategy, no one has a reason to change it. Furthermore, our simulation shows that this strategy will become highly abundant over long time scales due to its robustness against the invasion of other strategies. In this sense, the repeated social dilemma is solved for an arbitrary number of players.Repeated interaction promotes cooperation among rational individuals under the shadow of future, but it is hard to maintain cooperation when a large number of error-prone individuals are involved. One way to construct a cooperative Nash equilibrium is to find a 'friendly-rivalry' strategy, which aims at full cooperation but never allows the co-players to be better off. Recently it has been shown that for the iterated Prisoner's Dilemma in the presence of error, a friendly rival can be designed with the following five rules: Cooperate if everyone did, accept punishment for your own mistake, punish defection, recover cooperation if you find a chance, and defect in all the other circumstances. In this work, we construct such a friendly-rivalry strategy for the iterated n-person public-goods game by generalizing those five rules. The resulting strategy makes a decision with referring to the previous m = 2n - 1 rounds. A friendly-rivalry strategy for n = 2 inherently has evolutionary robustness in the sense that no mutant strategy has higher fixation probability in this population than that of a neutral mutant. Our evolutionary simulation indeed shows excellent performance of the proposed strategy in a broad range of environmental conditions when n = 2 and 3.


リンク情報
DOI
https://doi.org/10.1371/journal.pcbi.1008217
arXiv
http://arxiv.org/abs/arXiv:2008.00243
Web of Science
https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=JSTA_CEL&SrcApp=J_Gate_JST&DestLinkType=FullRecord&KeyUT=WOS:000612933300002&DestApp=WOS_CPL
URL
http://arxiv.org/abs/2008.00243v2
URL
http://arxiv.org/pdf/2008.00243v2 本文へのリンクあり
ID情報
  • DOI : 10.1371/journal.pcbi.1008217
  • ISSN : 1553-734X
  • eISSN : 1553-7358
  • arXiv ID : arXiv:2008.00243
  • Web of Science ID : WOS:000612933300002

エクスポート
BibTeX RIS