A choice function is backwards‐induction rationalizable if there exists a finite perfect‐information extensive‐form game such that for each subset of alternatives, the backwards‐induction outcome of the restriction of the game to that subset of alternatives coincides with the choice from that subset. We prove that every choice function is backwards‐induction rationalizable.
MLA
Bossert, Walter, and Yves Sprumont. “Every Choice Function Is Backwards‐Induction Rationalizable.” Econometrica, vol. 81, .no 6, Econometric Society, 2013, pp. 2521-2534, https://doi.org/10.3982/ECTA11419
Chicago
Bossert, Walter, and Yves Sprumont. “Every Choice Function Is Backwards‐Induction Rationalizable.” Econometrica, 81, .no 6, (Econometric Society: 2013), 2521-2534. https://doi.org/10.3982/ECTA11419
APA
Bossert, W., & Sprumont, Y. (2013). Every Choice Function Is Backwards‐Induction Rationalizable. Econometrica, 81(6), 2521-2534. https://doi.org/10.3982/ECTA11419
The Executive Committee of the Econometric Society has approved an increase in the submission fees for papers in Econometrica. Starting January 1, 2025, the fee for new submissions to Econometrica will be US$125 for regular members and US$50 for student members.
By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device. Cookies are used to optimize your experience and anonymously analyze website performance and traffic.