Publication Date: January 2003
This paper introduces generalized potential functions of complete information games and studies the robustness of sets of equilibria to incomplete information. A set of equilibria of a complete information game is robust if every incomplete information game where payoﬀs are almost always given by the complete information game has an equilibrium which generates behavior close to some equilibrium in the set. This paper provides suﬀicient conditions for the robustness of sets of equilibria in terms of argmax sets of generalized potential functions and shows that the suﬀicient conditions generalize the existing suﬀicient conditions for the robustness of equilibria.
incomplete information, potential, reﬁnements, robustness
JEL Classification Codes: C72, D82
Published in Journal of Economic Theory (September 2005), 124(1): 45-78 [DOI]