Abstract
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.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
