Exhaustive classification of stochastic cooperative-level dependent strategies in iterated prisoner’s dilemma

IF 5.6 1区 数学 Q1 MATHEMATICS, INTERDISCIPLINARY APPLICATIONS
C. Xu , P.M. Hui
{"title":"Exhaustive classification of stochastic cooperative-level dependent strategies in iterated prisoner’s dilemma","authors":"C. Xu ,&nbsp;P.M. Hui","doi":"10.1016/j.chaos.2024.115984","DOIUrl":null,"url":null,"abstract":"<div><div>We propose an infinitely iterated prisoner’s dilemma in which the stochastic strategies react to a global cooperative level. The cooperative level is a result of the collective actions of the agents, not only of the opponents. The stochastic strategies are represented by <span><math><mrow><mo>(</mo><mi>y</mi><mo>,</mo><mi>p</mi><mo>,</mo><mi>q</mi><mo>)</mo></mrow></math></span>, where <span><math><mi>p</mi></math></span> (<span><math><mi>q</mi></math></span>) is the probability of taking a cooperative action when the cooperative level is below (equal or above) a threshold <span><math><msub><mrow><mi>m</mi></mrow><mrow><mi>c</mi></mrow></msub></math></span>, and <span><math><mi>y</mi></math></span> is an initial cooperative probability. A relevant situation, among others, is that of budding yeast growing on sucrose, where the monosaccharide created by some yeasts are shared by those in the neighborhood. The decision on whether to create (to cooperate) monosaccharide or not (to defect) is dependent on the monosaccharide concentration and thus can be modeled by stochastic cooperative-level dependent strategies. We classify such stochastic strategies exhaustively for different values of <span><math><msub><mrow><mi>m</mi></mrow><mrow><mi>c</mi></mrow></msub></math></span>. All Nash equilibria are identified and strategies that are stable against invasion by selection pressure are characterized. The results are helpful in understanding the final winning strategies emerged in competing systems in which actions are decided based on the cooperative level.</div></div>","PeriodicalId":9764,"journal":{"name":"Chaos Solitons & Fractals","volume":"192 ","pages":"Article 115984"},"PeriodicalIF":5.6000,"publicationDate":"2025-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos Solitons & Fractals","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0960077924015364","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

We propose an infinitely iterated prisoner’s dilemma in which the stochastic strategies react to a global cooperative level. The cooperative level is a result of the collective actions of the agents, not only of the opponents. The stochastic strategies are represented by (y,p,q), where p (q) is the probability of taking a cooperative action when the cooperative level is below (equal or above) a threshold mc, and y is an initial cooperative probability. A relevant situation, among others, is that of budding yeast growing on sucrose, where the monosaccharide created by some yeasts are shared by those in the neighborhood. The decision on whether to create (to cooperate) monosaccharide or not (to defect) is dependent on the monosaccharide concentration and thus can be modeled by stochastic cooperative-level dependent strategies. We classify such stochastic strategies exhaustively for different values of mc. All Nash equilibria are identified and strategies that are stable against invasion by selection pressure are characterized. The results are helpful in understanding the final winning strategies emerged in competing systems in which actions are decided based on the cooperative level.
迭代囚徒困境中随机合作依赖策略的穷举分类
我们提出了一个无限迭代的囚徒困境,其中随机策略对全局合作水平作出反应。合作水平是代理人集体行动的结果,而不仅仅是对手的结果。随机策略用(y,p,q)表示,其中p (q)是当合作水平低于(等于或高于)阈值mc时采取合作行动的概率,y是初始合作概率。其中一个相关的情况是,在蔗糖上生长的芽殖酵母,其中一些酵母产生的单糖被附近的酵母共享。产生(合作)单糖或不产生(背叛)单糖的决策取决于单糖的浓度,因此可以用随机合作依赖策略来建模。我们针对不同的mc值对这些随机策略进行了详尽的分类。我们确定了所有的纳什均衡,并对那些抵抗选择压力入侵的稳定策略进行了表征。研究结果有助于理解基于合作水平决定行动的竞争系统中出现的最终获胜策略。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Chaos Solitons & Fractals
Chaos Solitons & Fractals 物理-数学跨学科应用
CiteScore
13.20
自引率
10.30%
发文量
1087
审稿时长
9 months
期刊介绍: Chaos, Solitons & Fractals strives to establish itself as a premier journal in the interdisciplinary realm of Nonlinear Science, Non-equilibrium, and Complex Phenomena. It welcomes submissions covering a broad spectrum of topics within this field, including dynamics, non-equilibrium processes in physics, chemistry, and geophysics, complex matter and networks, mathematical models, computational biology, applications to quantum and mesoscopic phenomena, fluctuations and random processes, self-organization, and social phenomena.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信