We provide comparable algorithms for the Dekel-Fudenberg procedure, iterated admissibility, proper rationalizability … algorithms for comparing iterated admissibility, proper rationalizability and full permissibility, and provide a sufficient …

In a Nash equilibrium, players' rationality is mutual knowledge. However, both intuition and experimental evidence … suggest that players do not know for sure the rationality of opponents. This paper proposes a new equilibrium concept … equilibrium, players do not necessarily know the rationality of opponents, but they view rationality as infinitely more likely …

-equilibrium approach, we show that N-person sequential bargaining games with exit are solvable by a refinement of rationalizability for … multi-stage games (trembling-hand rationalizability) whatever the impatience of the players. That is, once we adopt the non …

rationalizability. The concept aims to identify the consequences of common knowledge of rationality and farsightedness within the … environments and it can be computed by an iterative reduction procedure. We introduce a definition of coalitional rationality for … social environments and show that it is satisfied by social rationalizability …

rationality) when this may be observed by one's opponent. We present a model in which the strategic environment determines which … kind of rule rationality is adopted by the players. We apply the model to characterize the induced rules and outcomes in … various interesting environments. Finally, we show the close relations between act rationality and “Stackelberg stability” (no …

explicit the role of knowledge about rationality of players, not only that of payoff functions. For this purpose, we use an … bound order of mutual knowledge of rationality. This result implies that under common knowledge of rationality, the …