A note on rationalizability and restrictions on belief
Rationalizability is a widely accepted solution concept in the study of strategic form game with complete information and is fully characterized in terms of assumptions on the rationality of the players and common certainty of rationality. Battigalli and Siniscalchi extend rationalizability and derive the solution concept called ?-rationalizability. Their analysis is based on the following assumptions: (a) players are rational; (b) their first-order beliefs satisfy some restrictions; and (c) there is common belief of (a) and (b). In this note I focus on games with complete information and I characterize ?-rationalizability with a new notion of iterative dominance which is able to capture the additional hypothesis on players' beliefs.
|Date of creation:||Apr 2010|
|Date of revision:|
|Contact details of provider:|| Postal: Via Nazionale, 91 - 00184 Roma|
Web page: http://www.bancaditalia.it
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:bdi:wptemi:td_757_10. 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: ()
If references are entirely missing, you can add them using this form.