A logical characterization of iterated admissibility

Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge, TARK '09

Volumn , Issue , 2009, Pages 146-155

  Halpern, Joseph Y ^a   Pass, Rafael ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

KEISLER; LOGICAL CHARACTERIZATION; RICH STRUCTURE;

EID: 70350648681     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1562814.1562836     Document Type: Conference Paper

References (8)

1. Brandenburger, A., A. Friedenberg, and J. Keisler (2008). Admissibility in games. Econometrica 76(2), 307-352.
2. Halpern, J. Y. and G. Lakemeyer (2001). Multiagent only knowing. Journal of Logic and Computation 11(1), 41-70.
3. Levesque, H. J. (1990). All I know: a study in autoepistemic logic. Artificial Intelligence 42(3), 263-309.
4. Mas-Colell, A., M. Whinston, and J. Green (1995). Microeconomic Theory. Oxford, U.K.: Oxford University Press.
5. Osborne, M. J. and A. Rubinstein (1994). A Course in Game Theory. Cambridge, Mass.: MIT Press.
6. Pearce, D. G. (1984). Rationalizable strategic behavior and the problem of perfection. Econometrica 52(4), 1029-1050.
7. Rajan, U. (1998). Trembles in the Bayesian foundation of solution concepts. Journal of Economic Theory 82, 248-266.
8. Tan, T. and S. Werlang (1988). The Bayesian foundation of solution concepts of games. Journal of Economic Theory 45(45), 370-391.