Uncoupled Automata and Pure Nash Equilibria

Authors: 
Yakov Babichenko
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 Â…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.

Date: 
August, 2007
Published in: 
Number: 
459