Abstract
Strong-Δ-Rationalizability introduces first-order belief restrictions in the analysis of forward induction reasoning. Without actual restrictions, it coincides with Strong Rationalizability (Battigalli, 2003; Battigalli and Siniscalchi, 2003). These solution concepts are based on the notion of strong belief (Battigalli and Siniscalchi, 2002). The non-monotonicity of strong belief implies that the predictions of Strong-Δ-Rationalizability can be inconsistent with Strong Rationalizability. I show that Strong-Δ-Rationalizability refines Strong Rationalizability in terms of outcomes when the restrictions correspond to belief in a distribution over terminal nodes. Moreover, under such restrictions, the epistemic priority between rationality and belief restrictions is irrelevant for the predicted outcomes.
Sign-in/Register to access full text options 
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.
