This paper constructs a type space that contains all types with a finite depth of reasoning, as well as all types with an infinite depth of reasoning - in particular those types for whom finite-depth types are conceivable, or think that finite-depth types are conceivable in the mind of other...

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...

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...

We study how the predictive power of level-k models changes as we perturb the classical beauty contest setting along two dimensions: the strength of the coordination motive and the information symmetry. We use the Morris and Shin (2002) model as the unified framework for our study, and find that...

We have experimentally tested a theory of bounded rational behavior in a "lemon market". It provides an explanation for the observation that real world players successfully conclude transactions when perfect rationality predicts a market collapse. We analyzed two different market designs :...