The effect of memory size on the evolutionary stability of strategies in iterated prisoner's dilemma

The iterated prisoner's dilemma is an ideal model for the evolution of cooperation among payoff-maximizing individuals. It has attracted wide interest in the development of novel strategies since the success of tit-for-tat in Axelrod's iterated prisoner's dilemma competitions. Every strategy for iterated prisoner's dilemma utilizes a certain length of historical interactions with the opponent, which is regarded as the size of the memory, in making its choices. Intuitively, longer memory strategies must have an advantage over shorter memory strategies. In practice, however, most of the well known strategies are short memory strategies that utilize only the recent history of previous interactions. In this paper, the effect of the memory size of strategies on their evolutionary stability in both infinite length and indefinite length n -person iterated prisoner's dilemma is studied. Based on the concept of a counter strategy, we develop a theoretical methodology for evaluating the evolutionary stability of strategies and prove that longer memory strategies outperform shorter memory strategies statistically in the sense of evolutionary stability. We also give an example of a memory-two strategy to show how the theoretical study of evolutionary stability assists in developing novel strategies.