A coordination game with incomplete information is played through time. In each period, payoffs depend on a fundamental state and an additional idiosyncratic shock. Fundamentals evolve according to a random walk where the changes in fundamentals (namely common shocks) have a fat tailed...

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 payoffs are almost always given...

We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight...