The Robustness of Equilibria to Incomplete Information

Abstract

A number of papers have shown that a strict Nash equilibrium action profile of a game may never be played if there is a small amount of incomplete information (see, for example, Carlsson and van Damme (1993a)). We present a general approach to analyzing the robustness of equilibria to a small amount of incomplete information. A Nash equilibrium of a complete information game is said to be robust to incomplete information if every incomplete information game with payoffs almost always given by the complete information game has an equilibrium which generates behavior close to the Nash equilibrium. We show that many games with strict equilibria have no robust equilibrium and examine why we get such different results from existing refinements. If a game has a unique correlated equilibrium, it is robust. A natural many-player many-action generalization of risk dominance is a sufficient condition for robustness.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 297 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.