Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Strategies that enforce linear payoff relationships under observation errors in Repeated Prisoner's Dilemma game (1904.01208v2)

Published 2 Apr 2019 in q-bio.PE and physics.soc-ph

Abstract: The theory of repeated games analyzes the long-term relationship of interacting players and mathematically reveals the condition of how cooperation is achieved, which is not achieved in a one-shot game. In the repeated prisoner's dilemma (RPD) game with no errors, zero-determinant (ZD) strategies allow a player to unilaterally set a linear relationship between the player's own payoff and the opponent's payoff regardless of the strategy that the opponent implements. In contrast, unconditional strategies such as ALLD and ALLC also unilaterally set a linear payoff relationship. Errors often happen between players in the real world. However, little is known about the existence of such strategies in the RPD game with errors. Here, we analytically search for all strategies that enforce a linear payoff relationship under observation errors in the RPD game. As a result, we found that, even in the case with observation errors, the only strategy sets that enforce a linear payoff relationship are either ZD strategies or unconditional strategies and that no other strategies can enforce it, which were numerically confirmed.

Summary

We haven't generated a summary for this paper yet.