Abstract
Using lexicographic probability systems as representations of players’ beliefs, we define the solution procedure of directed lexicographic rationalizability. We show that the procedure characterizes the family of self-admissible sets (Brandenburger et al., 2008) in finite games. A corollary of this result is that comprehensive rationalizability (Heifetz et al., 2019) yields a self-admissible set.
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.
