1. Uncoupled automata and pure Nash equilibria.
- Author
-
Babichenko, Yakov
- Subjects
- *
NASH equilibrium , *DECISION theory , *MATHEMATICAL optimization , *GAME theory , *MATHEMATICAL models - Abstract
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. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF