We present a new solution concept for strategic games called comprehensive rationalizability that embodies "common cautious belief in rationality" based on a sound epistemic characterization in a universal type space. It refines rationalizability, but it neither refines nor is refined by...

We present a new solution concept for strategic games called comprehensive rationalizability that embodies "common cautious belief in rationality" based on a sound epistemic characterization in a universal type space. It refines rationalizability, but it neither refines nor is refined by...

One central issue tackled in epistemic game theory is whether for a general class of strategic games the solution generated by iterated application of a choice rule gives exactly the strategy profiles that might be realized by players who follow this choice rule and commonly believe they follow...

One central issue tackled in epistemic game theory is whether for a general class of strategic games the solution generated by iterated application of a choice rule gives exactly the strategy profiles that might be realized by players who follow this choice rule and commonly believe they follow...

We discuss a number of conceptual issues that arise in attempting to capture, in dynamic games, the notion that there is common understanding among the players that they are all rational.

We introduce consistency of beliefs in the space of hierarchies of conditional beliefs (Battigalli and Siniscalchi) and use it to provide epistemic conditions for equilibria in finite multi-stage games with observed actions.