UNCOUPLED AUTOMATA AND PURE NASH EQUILIBRIA

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.

Location: 
Elath Hall, 2nd floor, Feldman Building, Edmond J. Safra Campus
Dates: 
Sunday, May 20, 2007 - 16:15 to 18:00
Old Lecturers: 
YAAKOV BABICHENKO
Old Lecturers University: 
THE HEBREW UNIVERSITY