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

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 infnite-depth types are conceivable in the mind of other...