论文信息 - Weak assumption and iterative admissibility

Weak assumption and iterative admissibility

Brandenburger et al. (2008a) show that rationality and common assumption of rationality (RCAR) is impossible in a complete and continuous type structure. We show, by introducing an alternative notion of assumption, “weak assumption”, that rationality and common weak assumption of rationality (RCWAR) is possible in a complete and continuous type structure. This possibility result provides an epistemic characterization for iterative admissibility.

Chih-Chun Yang

[1] P. Meyer,et al. Probabilities and potential C , 1978 .

[2] Larry Samuelson,et al. Dominated strategies and common knowledge , 1992 .

[3] Eddie Dekel,et al. Lexicographic Probabilities and Equilibrium Refinements , 1991 .

[4] H. Jerome Keisler,et al. Admissibility in Games1 , 2008 .

[5] Spyros Galanis,et al. Admissibility and Event-Rationality , 2012, Games Econ. Behav..

[6] S. Zamir,et al. Formulation of Bayesian analysis for games with incomplete information , 1985 .

[7] H. Keisler,et al. ADMISSIBILITY IN GAMES , 2008 .

[8] A. Kechris. Classical descriptive set theory , 1987 .

[9] Eddie Dekel,et al. Hierarchies of Beliefs and Common Knowledge , 1993 .

[10] A. Heifetz. The bayesian formulation of incomplete information — The non-compact case , 1993 .

[11] K. Parthasarathy,et al. Probability measures on metric spaces , 1967 .

[12] Emiliano Catonini,et al. Common assumption of cautious rationality and iterated admissibility , 2014 .

[13] R. Bass,et al. Review: P. Billingsley, Convergence of probability measures , 1971 .

[14] A. FRIEDENBERG,et al. Supplement to "Admissibility in Games": Appendices , 2008 .

[15] H. Jerome Keisler,et al. Common assumption of rationality , 2011, Journal of Mathematical Economics.