Repeated proximity games

T. TOMALA, J. Renault

International Journal of Game Theory

1998, vol. 27, n°4, pp.539-559

Départements : Economie et Sciences de la décision, GREGHEC (CNRS)

Mots clés : Repeated games, Folk theorem, imperfect monitoring, graphs

Keywords Plus: NASH EQUILIBRIA; INFORMATION Abstract: We consider repeated games with complete information acid imperfect monitoring, where each player is assigned a fixed subset of players and only observes the moves chosen by the players in this subset. This structure is naturally represented by a directed graph. We prove that a generalized folk theorem holds for any payoff function if and only if the graph is 2-connected, and then extend this result to the context of finitely repeated games