Abstract:

We study the problem of reaching Nash equilibria in multi-person games that are repeatedly played, under the assumption of uncoupledness: every player knows only his own payoff function. We consider strategies that can be implemented by 'łdots}finite-state automata, and characterize the minimal number of states needed in order to guarantee that a pure Nash equilibrium is reached in every game where such an equilibrium exists.

Website