In normal-form games, rationalizability (Bernheim, 1984, Pearce, 1984) on its own fails to exclude some very implausible strategy choices. Three main refinements of rationalizability have been proposed in the literature: cautious, perfect, and proper rationalizability. Nevertheless, some of...

Rationalizability is a central concept in game theory. Since there may be many rationalizable strategies, applications commonly use refinements to obtain sharp predictions. In an important paper, Weinstein and Yildiz (2007) show that no refinement is robust to perturbations of high-order...

Weinstein and Yildiz (Econometrica, 2007) have shown that only very weak predictions are robust to mispecifications of higher order beliefs. Whenever a type has multiple rationalizable actions, any of these actions is uniquely rationalizable for some arbitrarily close type. Hence, refinements of...

In normal-form games, rationalizability (Bernheim [3], Pearce [11]) on its own fails to exclude some very implausible strategy choices. Three main refinements of rationalizability have been proposed in the literature: cautious, perfect, and proper rationalizability. Nevertheless, some of these...

Weinstein and Yildiz (Econometrica, 2007) have shown that only very weak predictions are robust to mispecifications of higher order beliefs. Whenever a type has multiple rationalizable actions, any of these actions is uniquely rationalizable for some arbitrarily close type. Hence, refinements of...

In normal-form games, rationalizability (Bernheim [3], Pearce [11]) on its own fails to exclude some very implausible strategy choices. Three main refinements of ra- tionalizability have been proposed in the literature: cautious, perfect, and proper rationalizability. Nevertheless, some of these...

Two approaches have been proposed in the literature to refine the rationalizability solution concept: either assuming that players make small errors when playing their strategies, or assuming that there is a small amount of payoff uncertainty. We show that both approaches lead to the same...

This paper introduces the notion of nested best response potentials for complete information games. It is shown that a unique maximizer of such a potential is a Nash equilibrium that is robust to incomplete information in the sense of Kajii and Morris (1997, mimeo).

This paper introduces the notion of nested best-response potentials for complete in- formation games. It is shown that a unique maximizer of such a potential is a Nash equilibrium that is robust to incomplete information in the sense of Kajii and Morris (1997, mimeo).

This chapter is devoted to the study of Nash equilibria, and correlated equilibria in both finite and infinite games. We restrict our discussions to only those properties that are somewhat special to the case of two-person games. Many of these properties fail to extend even to three-person...