Effects of an update mechanism based on combinatorial memory and high-reputation learning objects on the evolution of cooperation

IF 3.5 2区 数学 Q1 MATHEMATICS, APPLIED Applied Mathematics and Computation Pub Date : 2025-01-23 DOI:10.1016/j.amc.2025.129309
Qianxi Yang, Yanlong Yang
{"title":"Effects of an update mechanism based on combinatorial memory and high-reputation learning objects on the evolution of cooperation","authors":"Qianxi Yang, Yanlong Yang","doi":"10.1016/j.amc.2025.129309","DOIUrl":null,"url":null,"abstract":"In human society, various factors influence decision-making, including memory, reputation, aspiration, etc. In recent years, research has increasingly focused on considering these factors and designing mechanisms to promote cooperation. However, few previous studies have simultaneously considered the effects of memory and reputation on cooperative evolution. Additionally, research on cooperation evolution based on memory mechanisms often focuses either on the strategy stability of the players themselves or on the strategy stability of the learning objects, but not both. Our study introduces an update mechanism based on combinatorial memory and high-reputation learning objects. This mechanism accounts for reputation and memory, where the memory effect includes the strategy stability of both the players and the learning objects. Specifically, at the stage of selecting learning objects, players prefer high-reputation individuals. We introduce a global selection weight, <ce:italic>η</ce:italic>, which allows players to select learning objects not only locally but also globally. At the stage of updating the strategy, each player simultaneously considers their own historical memory and the memory of their learning objects, with the parameter <ce:italic>γ</ce:italic> representing the memory weight of the learning objects. Monte Carlo simulations show that update rules that simultaneously consider both combinatorial memory and high-reputation learning objects are more effective in promoting cooperation than considering either factor alone. Furthermore, a small memory weight of the learning objects and a small global selection weight create an optimal environment for cooperation. Our study offers a novel approach to addressing social dilemmas and mitigating defection, emphasizing the critical roles of reputation and memory in the propagation of altruistic behavior.","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"111 1","pages":""},"PeriodicalIF":3.5000,"publicationDate":"2025-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1016/j.amc.2025.129309","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In human society, various factors influence decision-making, including memory, reputation, aspiration, etc. In recent years, research has increasingly focused on considering these factors and designing mechanisms to promote cooperation. However, few previous studies have simultaneously considered the effects of memory and reputation on cooperative evolution. Additionally, research on cooperation evolution based on memory mechanisms often focuses either on the strategy stability of the players themselves or on the strategy stability of the learning objects, but not both. Our study introduces an update mechanism based on combinatorial memory and high-reputation learning objects. This mechanism accounts for reputation and memory, where the memory effect includes the strategy stability of both the players and the learning objects. Specifically, at the stage of selecting learning objects, players prefer high-reputation individuals. We introduce a global selection weight, η, which allows players to select learning objects not only locally but also globally. At the stage of updating the strategy, each player simultaneously considers their own historical memory and the memory of their learning objects, with the parameter γ representing the memory weight of the learning objects. Monte Carlo simulations show that update rules that simultaneously consider both combinatorial memory and high-reputation learning objects are more effective in promoting cooperation than considering either factor alone. Furthermore, a small memory weight of the learning objects and a small global selection weight create an optimal environment for cooperation. Our study offers a novel approach to addressing social dilemmas and mitigating defection, emphasizing the critical roles of reputation and memory in the propagation of altruistic behavior.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
7.90
自引率
10.00%
发文量
755
审稿时长
36 days
期刊介绍: Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.
期刊最新文献
OP-HHO based feature selection improves the performance of depression classification framework: A gender biased multiband research Graphs having two main eigenvalues and arbitrarily many distinct vertex degrees Data-driven-based fully distributed event-triggered control for nonlinear multi-agent systems A note on block-transitive 2 − (v,k,1) designs A modulus-based framework for weighted horizontal linear complementarity problems
×
引用
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