AUTOMATA, REPEATED GAMES AND NOISE

摘要

We consider two-state automata playing repeatedly the Prisoner's Dilemma (or any other 2 x 2 game). The 16 x 16-payoff matrix is computed for the limiting case of a vanishingly small noise term affecting the interaction. Some results concerning the evolution of populations of automata under the action of selection are obtained. The special role of 'win-stay, lose-shift'-strategies is examined. [References: 29]