How can we know in advance whether simplifying assumptions about beliefs will make a difference in the conclusions of game-theoretic models? We define critical types to be types whose rationalizable correspondence is sensitive to assumptions about arbitrarily high-order beliefs. We show that a type is critical if and only if it exhibits common belief in some non-trivial event. We use this characterization to show that all types in commonly used type spaces are critical. On the other hand, we show that regular types (types that are not critical) are generic, although perhaps inconvenient to use in applications. Copyright 2011, Oxford University Press.
Volume (Year): 78 (2011)
Issue (Month): 3 ()
|Contact details of provider:|| |
When requesting a correction, please mention this item's handle: RePEc:oup:restud:v:78:y:2011:i:3:p:907-937. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Oxford University Press)or (Christopher F. Baum)
If references are entirely missing, you can add them using this form.