Evolution of cooperation driven by sampling reward

IF 2.6 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS Journal of Physics Complexity Pub Date : 2023-10-10 DOI:10.1088/2632-072x/ad0208
Jiafeng Xiao, Linjie Liu, Xiaojie Chen, Attila Szolnoki
{"title":"Evolution of cooperation driven by sampling reward","authors":"Jiafeng Xiao, Linjie Liu, Xiaojie Chen, Attila Szolnoki","doi":"10.1088/2632-072x/ad0208","DOIUrl":null,"url":null,"abstract":"Abstract A social dilemma implies that individuals will choose the defection strategy to maximize their individual gains. Reward is a powerful motivator to promote the evolution of cooperation, thus addressing the social dilemma. Nevertheless, it is costly since we need to monitor all participants in the game. Inspired by these observations, we here propose an inexpensive protocol, a so-called sampling reward mechanism, and apply it to social dilemmas, including public goods game and collective-risk social dilemma. More precisely, the actual usage of reward depends on the portion of cooperators in the sample. We show that the average cooperation level can be effectively improved under high reward threshold and high reward intensity, albeit at the expense of reward cost. It is intriguing to discover that for the latter aspect, there is a critical threshold at which further increases in reward intensity have no significant effect on improving the cooperation level. Moreover, we find that the small sample size favors the evolution of cooperation while an intermediate sample size always results in a lower reward cost. We also demonstrate that our findings are robust and remain valid for both types of social dilemma.
","PeriodicalId":53211,"journal":{"name":"Journal of Physics Complexity","volume":"40 1","pages":"0"},"PeriodicalIF":2.6000,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Physics Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1088/2632-072x/ad0208","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

Abstract A social dilemma implies that individuals will choose the defection strategy to maximize their individual gains. Reward is a powerful motivator to promote the evolution of cooperation, thus addressing the social dilemma. Nevertheless, it is costly since we need to monitor all participants in the game. Inspired by these observations, we here propose an inexpensive protocol, a so-called sampling reward mechanism, and apply it to social dilemmas, including public goods game and collective-risk social dilemma. More precisely, the actual usage of reward depends on the portion of cooperators in the sample. We show that the average cooperation level can be effectively improved under high reward threshold and high reward intensity, albeit at the expense of reward cost. It is intriguing to discover that for the latter aspect, there is a critical threshold at which further increases in reward intensity have no significant effect on improving the cooperation level. Moreover, we find that the small sample size favors the evolution of cooperation while an intermediate sample size always results in a lower reward cost. We also demonstrate that our findings are robust and remain valid for both types of social dilemma.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
抽样奖励驱动下的合作进化
摘要社会困境是指个体为了实现自身利益最大化而选择背叛策略。奖励是促进合作进化的强大动力,从而解决了社会困境。然而,这是昂贵的,因为我们需要监控游戏中的所有参与者。受这些观察结果的启发,我们提出了一种廉价的协议,即所谓的抽样奖励机制,并将其应用于社会困境,包括公共产品博弈和集体风险社会困境。更准确地说,奖励的实际使用取决于样本中合作者的比例。研究表明,在高奖励门槛和高奖励强度条件下,平均合作水平可以有效提高,但要付出一定的奖励成本。有趣的是,对于后者,存在一个临界阈值,在此阈值下,奖励强度的进一步增加对合作水平的提高没有显著影响。此外,我们发现小样本容量有利于合作的进化,而中等样本容量总是导致较低的奖励成本。我们还证明了我们的发现是稳健的,并且对于两种类型的社会困境都是有效的。& & #xD;
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of Physics Complexity
Journal of Physics Complexity Computer Science-Information Systems
CiteScore
4.30
自引率
11.10%
发文量
45
审稿时长
14 weeks
期刊最新文献
Persistent Mayer Dirac. Fitness-based growth of directed networks with hierarchy The ultrametric backbone is the union of all minimum spanning forests. Exploring the space of graphs with fixed discrete curvatures Augmentations of Forman’s Ricci curvature and their applications in community detection
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1