Abstract

This paper shows that common p-belief of rationality implies p-rationalizability for games with compact strategy sets. We also establish the Bayesian foundation for the perfect p-rationalizability for finite games. The p-rationalizability is then used to analyze the robustness of rationalizable sets. For any game with compact strategy sets, we show that the rationalizable set is robust, i.e., the strategies characterized by common p-belief of rationality are close to the rationalizable set when p → 1 .

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 call

Disclaimer: 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.