A Round-Robin Tournament of the Iterated Prisoner's Dilemma with Complete Memory-Size-Three Strategies

Abstract

In this paper the results of a simulation of a prisoner’s dilemma robinround tournament are presented. In the tournament each participating strategy plays an iterated prisoner’s dilemma against each other strategy (round-robin) and as a variant also against itself. The participants of a tournament are all strategies that are deterministic and have the same size of memory with regard to their own and their opponent’s past actions: up to three most recent actions of their opponent and up to two most recent actions of their own. A focus is set on the investigation of the inuence of the number of iterations, details of the payo