A note on rationalizability and restrictions on beliefs
AbstractRationalizability 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by Bank of Italy, Economic Research and International Relations Area in its series Temi di discussione (Economic working papers) with number 757.
Date of creation: Apr 2010
Date of revision:
rationalizability; strategic form game; complete information;
Find related papers by JEL classification:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-05-08 (All new papers)
- NEP-GTH-2010-05-08 (Game Theory)
- NEP-UPT-2010-05-08 (Utility Models & Prospect Theory)
You can help add them by filling out this form.
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.