Combination with anti-tit-for-tat remedies problems of tit-for-tat
arXiv:1610.07406 · doi:10.1016/j.jtbi.2016.09.017
Abstract
One of the most important questions in game theory concerns how mutual cooperation can be achieved and maintained in a social dilemma. In Axelrod's tournaments of the iterated prisoner's dilemma, Tit-for-Tat (TFT) demonstrated the role of reciprocity in the emergence of cooperation. However, the stability of TFT does not hold in the presence of implementation error, and a TFT population is prone to neutral drift to unconditional cooperation, which eventually invites defectors. We argue that a combination of TFT and anti-TFT (ATFT) overcomes these difficulties in a noisy environment, provided that ATFT is defined as choosing the opposite to the opponent's last move. According to this TFT-ATFT strategy, a player normally uses TFT; turns to ATFT upon recognizing his or her own error; returns to TFT either when mutual cooperation is recovered or when the opponent unilaterally defects twice in a row. The proposed strategy provides simple and deterministic behavioral rules for correcting implementation error in a way that cannot be exploited by the opponent, and suppresses the neutral drift to unconditional cooperation.
21 pages, 3 figures
References in corpus (4)
Cited by in corpus (15)
- Social norms in indirect reciprocity with ternary reputations
- Memory-two zero-determinant strategies in repeated games
- Evolutionary instability of selfish learning in repeated games
- Evolution of direct reciprocity in group-structured populations
- Local stability of cooperation in a continuous model of indirect reciprocity
- Signalling boosts the evolution of cooperation in repeated group interactions
- Friendly-rivalry solution to the iterated -person public-goods game
- Tit-for-Tat Strategy as a Deformed Zero-Determinant Strategy in Repeated Games
- Grouping promotes both partnership and rivalry with long memory in direct reciprocity
- Unbeatable Tit-for-Tat as a Zero-Determinant Strategy
- Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners' dilemma game
- Controlling conditional expectations by zero-determinant strategies
- Persistent homology and the shape of evolutionary games
- Unexploitable games and unbeatable strategies
- Strategies that enforce linear payoff relationships under observation errors in Repeated Prisoner's Dilemma game