Memory-two zero-determinant strategies in repeated games
Data files
May 18, 2021 version files 4.33 KB
Abstract
Repeated games have provided an explanation how mutual cooperation can be achieved even if defection is more favorable in a one-shot game in prisoner's dilemma situation.
Recently found zero-determinant strategies have substantially been investigated in evolutionary game theory.
The original memory-one zero-determinant strategies unilaterally enforce linear relations between average payoffs of players.
Here, we extend the concept of zero-determinant strategies to memory-two strategies in repeated games.
Memory-two zero-determinant strategies unilaterally enforce linear relations between correlation functions of payoffs and payoffs at the previous round.
Examples of memory-two zero-determinant strategy in the repeated prisoner's dilemma game are provided, some of which generalize the Tit-for-Tat strategy to memory-two case.
Extension of zero-determinant strategies to memory-$n$ case with $n\geq 2$ is also straightforward.
- Ueda, Masahiko (2021), Memory-two zero-determinant strategies in repeated games, Royal Society Open Science, Journal-article, https://doi.org/10.1098/rsos.202186
- Ueda, Masahiko (2021), Memory-two zero-determinant strategies in repeated games, , Article, https://doi.org/10.5281/zenodo.4589641
