当前位置:
X-MOL 学术
›
arXiv.cs.GT
›
论文详情
Our official English website, www.x-mol.net, welcomes your
feedback! (Note: you will need to create a separate account there.)
Memory-two zero-determinant strategies in repeated games
arXiv - CS - Computer Science and Game Theory Pub Date : 2020-11-13 , DOI: arxiv-2011.06772 Masahiko Ueda
arXiv - CS - Computer Science and Game Theory Pub Date : 2020-11-13 , DOI: arxiv-2011.06772 Masahiko Ueda
We extend the concept of zero-determinant strategies to memory-two strategies
in repeated games. Memory-two zero-determinant strategies unilaterally enforce
linear relation between correlation functions of payoffs and payoffs at the
previous round. Examples of memory-two zero-determinant strategy in repeated
prisoner's dilemma game is provided. Extension of zero-determinant strategies
to memory-$n$ case with $n\geq 2$ is also straightforward.
中文翻译:
重复博弈中的记忆二零决定因素策略
我们将零决定因素策略的概念扩展到重复博弈中的记忆二策略。记忆二零行列式策略单方面强制执行收益和前一轮收益的相关函数之间的线性关系。提供了重复囚徒困境博弈中记忆二零决定因素策略的例子。使用 $n\geq 2$ 将零行列式策略扩展到 memory-$n$ 的情况也很简单。
更新日期:2020-11-19
中文翻译:
重复博弈中的记忆二零决定因素策略
我们将零决定因素策略的概念扩展到重复博弈中的记忆二策略。记忆二零行列式策略单方面强制执行收益和前一轮收益的相关函数之间的线性关系。提供了重复囚徒困境博弈中记忆二零决定因素策略的例子。使用 $n\geq 2$ 将零行列式策略扩展到 memory-$n$ 的情况也很简单。