Please use this identifier to cite or link to this item: https://hdl.handle.net/10419/187494 
Year of Publication: 
2017
Series/Report no.: 
Working Paper No. 17-4
Publisher: 
University of California, Department of Economics, Davis, CA
Abstract: 
We present a new solution concept for strategic games called comprehensive rationalizability that embodies "common cautious belief in rationality" based on a sound epistemic characterization in a universal type space. It refines rationalizability, but it neither refines nor is refined by iterated admissibility. Nevertheless, it coincides with iterated admissibility in many relevant economic applications.
Subjects: 
Common assumption of rationality
common belief in rationality
iterated admissibility
rationalizability
lexicographic belief systems
JEL: 
C72
Document Type: 
Working Paper

Files in This Item:
File
Size
539.89 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.