Abstract
Consider a decision-maker (DM) who must select an alternative from a set of mutually exclusive alternatives but must take this decision sequentially. If the DM’s choice correspondence over subsets of alternatives satisfies the weak axiom of revealed preference (WARP), then the subgame perfect Nash equilibrium (SPNE) and backward induction (BI) strategies coincide. We study the relation between the SPNE and BI strategies when the DM’s choice correspondence fails to satisfy WARP. First, Sen’s axiom α is necessary and sufficient for the set of SPNE strategies to be a subset of the set of BI strategies; moreover, a mild strengthening of Sen’s axiom β is necessary and sufficient for the set of BI strategies to be a subset of the set of SPNE strategies. These results extend to multiplayer games. (JEL D11, C72, C73)
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.
