This paper studies implementation of cooperative payoffs in finitely repeated games when players implement their strategies by finite automata of big sizes. Specifically, we analyze how much we have to depart from fully rational behavior to achieve the Folk Theorem payoffs, i.e., which are the...

This paper is a note in which we prove that Cellular Automata are suitable tools to model multi-agent interactive procedures. In particular, we apply the argument to validate results from simulation tools obtained for the classical model of segregation of Thomas Schelling (1971a).

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...