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

The concepts of sequential and quasi-perfect rationalizability are defined in an epistemic model by means of lexicographic probabilities. These are non-equilibrium analogs to sequential and quasi-perfect equilibrium, for which epistemic characterizations are provided. The defined...