for some arbitrarily close type. Hence, refinements of rationalizability are not robust. This negative result is obtained … settings this condition entails an unnecessarily demanding robustness test. It is therefore natural to explore the structure of … rationalizability when arbitrary common knowledge assumptions are relaxed (i.e., without assuming richness). For arbitrary spaces of …

for some arbitrarily close type. Hence, refinements of rationalizability are not robust. This negative result is obtained … settings this condition entails an unnecessarily demanding robustness test. It is therefore natural to explore the structure of … rationalizability when arbitrary common knowledge assumptions are relaxed (i.e., without assuming richness). For arbitrary spaces 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 beliefs. We show that robust refinements do exist if we relax the assumption …

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 beliefs. We show that robust refinements do exist if we relax the assumption …

This paper introduces generalized potential functions of complete information games and studies the robustness of sets … behavior close to some equilibrium in the set. This paper provides sufficient conditions for the robustness of sets of … existing sufficient conditions for the robustness of equilibria. …