Suppr超能文献

重复博弈中的记忆二零行列式策略。

Memory-two zero-determinant strategies in repeated games.

作者信息

Ueda Masahiko

机构信息

Graduate School of Sciences and Technology for Innovation, Yamaguchi University, Yamaguchi 753-8511, Japan.

出版信息

R Soc Open Sci. 2021 May 26;8(5):202186. doi: 10.1098/rsos.202186.

Abstract

Repeated games have provided an explanation of how mutual cooperation can be achieved even if defection is more favourable in a one-shot game in the Prisoner's Dilemma situation. Recently found zero-determinant (ZD) strategies have substantially been investigated in evolutionary game theory. The original memory-one ZD strategies unilaterally enforce linear relationships between average pay-offs of players. Here, we extend the concept of ZD strategies to memory-two strategies in repeated games. Memory-two ZD strategies unilaterally enforce linear relationships between correlation functions of pay-offs and pay-offs of the previous round. Examples of memory-two ZD strategy in the repeated Prisoner's Dilemma game are provided, some of which generalize the tit-for-tat strategy to a memory-two case. Extension of ZD strategies to memory- case with ≥ ~2 is also straightforward.

摘要

重复博弈为即使在囚徒困境情形下一次性博弈中背叛更有利时如何实现相互合作提供了解释。近期发现的零行列式(ZD)策略在进化博弈论中得到了大量研究。最初的记忆一型ZD策略单方面强制玩家平均收益之间的线性关系。在此,我们将ZD策略的概念扩展到重复博弈中的记忆二型策略。记忆二型ZD策略单方面强制收益的相关函数与上一轮收益之间的线性关系。给出了重复囚徒困境博弈中记忆二型ZD策略的例子,其中一些将针锋相对策略推广到了记忆二型情形。将ZD策略扩展到记忆(m\geq2)的情形也很简单。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/f113/8150048/bdb56840bd4b/rsos202186f01.jpg

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验