We define a concept of epistemic robustness in the context of an epistemic model of a finite normal game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure strategy subsets is epistemically robust if there is a Cartesian...

We define a concept of epistemic robustness in the context of an epistemic model of a finite normal-form game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure-strategy subsets is epistemically robust if there is a...

Type structures are a simple device to describe higher-order beliefs. However, how can we check whether two types generate the same belief hierarchy? This paper generalizes the concept of a type morphism and shows that one type structure is contained in another if and only if the former can be...

We define a concept of epistemic robustness in the context of an epistemic model of a finite normal-form game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure-strategy subsets is epistemically robust if there is a...

Type structures are a simple device to describe higher-order beliefs. However, how can we check whether two types generate the same belief hierarchy? This paper generalizes the concept of a type morphism and shows that one type structure is contained in another if and only if the former can be...

We define a concept of epistemic robustness in the context of an epistemic model of a finite normal game where a player type corresponds to a belief over the profiles of opponent strategies and types. A Cartesian product X of pure strategy subsets is epistemically robust if there is a Cartesian...