We devise a sound and complete epistemic-logic axiomatization for Knightian type spaces - the generalization of Harsanyi type spaces employed in strategic games with asymmetric uncertainty/ambiguity. In a Knightian type space, each type's epistemic attitude is represented by a set of probability...

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 none of these refinements is robust to perturbations of...

We define a cautious version of extensive-form rationalizability for generalized extensive-form games with unawareness that we call prudent rationalizability. It is an extensive-form analogue of iterated admissibility. In each round of the procedure, for each tree and each information set of a...

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

In an important paper, Weinstein and Yildiz (2007) show that if players have an infinite depth of reasoning and this is commonly believed, types generically have a unique rationalizable action in games that satisfy a richness condition. We show that this result does not extend to environments...

We define a cautious version of extensive-form rationalizability for generalized extensive- form games with unawareness that we call prudent rationalizability. It is an extensive-form analogue of iterated admissibility. In each round of the procedure, for each tree and each information set of a...

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

In an important paper, Weinstein and Yildiz (2007) show that if players have an infinite depth of reasoning and this is commonly believed, types generically have a unique rationalizable action in games that satisfy a richness condition. We show that this result does not extend to environments...

We define a cautious version of extensive-form rationalizability for generalized extensive-form games with unawareness that we call prudent rationalizability. It is an extensive-form analogue of iterated admissibility. In each round of the procedure, for each tree and each information set of a...

Heifetz, Meier and Schipper (2005) introduced a generalized state-space model that allows for non-trivial unawareness among several individuals and strong properties of knowledge. We show that this generalized state-space model arises naturally if states consist of maximally consistent sets of...