Uncoupled automata and pure Nash equilibria
We study the problem of reaching a pure Nash equilibrium 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.
KeywordsAutomaton Nash equilibrium Uncoupledness
Unable to display preview. Download preview PDF.