{"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.
期刊介绍:
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.