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.

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. -- epistemic game theory ; epistemic...

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. -- Epistemic game theory ; epistemic stability ; rationalizability ;...

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

Proper consistency is defined by the properties that each player takes all opponent strategies into account (is cautious) and deems one opponent strategy to be infinitely more likely than another if the opponent prefers the one to the other (respects preferences). When there is common certain...

We justify the application to extensive games of the concept of ‘fully permissible sets’, which corresponds to choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on the set of all...

The concept of ‘fully permissible sets’ is defined by an algorithm that eliminates strategy subsets. It is characterized as choice sets when there is common certain belief of the event that each player prefer one strategy to another if and only if the former weakly dominates the latter on...

I characterize backward induction in an epistemic model of perfect information games where players have common certain belief of the consistency of preferences rather than the rationality of choice. In this approach, backward induction corresponds to common certain belief of ‘belief in each...

We provide comparable algorithms for the Dekel-Fudenberg procedure, iterated admissibility, proper rationalizability and full permissibility by means of the concepts of preference restrictions and likelihood orderings. We apply the algorithms for comparing iterated admissibility, proper...