COMMUNICATION AND AUTOMATA

The main contribution of this paper is to present a new procedure to reach cooperation through pseudorandom schemes in the finitely repeated Prisoner's Dilemma game, when strategies are implemented by automata. The equilibrium path consists of a communication process followed by a coordinated play. The choice of the set of communication messages is efficient since it is the minimum set with respect to the whole coordination procedure. This allows us to reach efficient outcomes with automata complexity lying between the ones already offered in the literature.