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

This paper provides two conditions of epistemic robustness, robustness to alternative best replies and robustness to non-best replies, and uses them to characterize variants of curb sets in finite games, including the set of rationalizable strategies.

The issue of the order-dependence of iterative deletion processes is well-known in the game theory community, and meanwhile conditions on the dominance concept underlying these processes have been detected which ensure order-independence (see e.g. the criteria of Gilboa et al., 1990 and Apt,...

This paper provides a definition of epistemic stability of sets of strategy profiles, and uses it to characterize variants of curb sets in finite games, including the set of rationalizable strategies and minimal curb sets.

Type structures are a simple device to describe higher-order beliefs. But 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 mapped...

Battigalli and Siniscalchi (2002) formalize the idea of forward induction reasoning as "rationality and common strong belief of rationality" (RCSBR). Here, we study the behavioral implications of RCSBR across all type structures. Formally, we show that RCSBR is characterized by a solution...

In many experiments, the Nash equilibrium concept seems not to predict well. One reason may be that players have non-selfish preferences over outcomes. As a consequence, even when they are told what the material payoffs of the game are, mutual knowledge of preferences may not be satisfied. We...

We extend the Ståhl-Rubinstein alternating-offer bargaining procedure to allow players, prior to each bargaining round, to simultaneously and visibly commit to some share of the pie. If commitment costs are small but increasing in the committed share, then the unique outcome consistent with...