Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 1994 May 21;168(2):117-30.
doi: 10.1006/jtbi.1994.1092.

No strategy is evolutionarily stable in the repeated prisoner's dilemma

Affiliations
Free article

No strategy is evolutionarily stable in the repeated prisoner's dilemma

J Lorberbaum. J Theor Biol. .
Free article

Abstract

Following the influential work of Axelrod, the repeated Prisoner's Dilemma game has become the theoretical gold standard for understanding the evolution of co-operative behavior among unrelated individuals. Using the game, several authors have found that a reciprocal strategy known as Tit for Tat (TFT) has done quite well in a wide range of environments. TFT strategists start out co-operating and then do what the other player did on the previous move. Despite the success of TFT and similar strategies in experimental studies of the game, Boyd & Lorberbaum (1987, Nature, Lond. 327, 58) have shown that no pure strategy, including TFT, is evolutionarily stable in the sense that each can be invaded by the joint effect of two invading strategies when long-term interaction occurs in the repeated game and future moves are discounted. Farrell & Ware (1989, Theor. Popul. Biol. 36, 161) have since extended these results to include finite mixes of pure strategies as well. Here, it is proven that no strategy is evolutionarily stable when long-term relationships are maintained in the repeated Prisoner's Dilemma and future moves are discounted. Namely, it is shown each completely probabilistic strategy (i.e. one that both co-operates and defects with positive probability after every sequence of behavior) may be invaded by a single deviant strategy. This completes the proof started by Boyd and Lorberbaum and extended by Farrell and Ware. This paper goes on to prove that no reactive strategy with a memory restricted to the opponent's preceding move is evolutionarily stable when there is no discounting of future moves. This is true despite the success of a more forgiving variant of TFT called GTFT in a recent tournament among reactive strategies conducted by Nowak & Sigmund (1992, Nature 355, 250) where future moves were not discounted. GTFT, for example, may be invaded by a pair of reactive mutants. Since no strategy is evolutionarily stable when future moves are discounted in the repeated game, the restriction of strategy types to those actually maintained by mutation and phenotypic and environmental variability in natural populations may be the key to understanding the evolution of co-operation. However, the result presented here that the somewhat realistic reactive strategies are also not evolutionarily stable at least in the non-discounted game suggests something else may be going on. For one, the proof that no reactive strategy is evolutionarily stable ironically shows the robustness of TFT-like strategies.(ABSTRACT TRUNCATED AT 400 WORDS)

PubMed Disclaimer

LinkOut - more resources