IDEAS home Printed from https://ideas.repec.org/a/ecm/emetrp/v81y2013i6p2521-2534.html

Every Choice Function Is Backwards‐Induction Rationalizable

Author

Listed:
  • Walter Bossert
  • Yves Sprumont

Abstract

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.
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Walter Bossert & Yves Sprumont, 2013. "Every Choice Function Is Backwards‐Induction Rationalizable," Econometrica, Econometric Society, vol. 81(6), pages 2521-2534, November.
    • Handle: RePEc:ecm:emetrp:v:81:y:2013:i:6:p:2521-2534
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.3982/
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or

    for a different version of it.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Serhat Dogan & Kemal Yildiz, 2023. "Every Choice Function Is Pro-Con Rationalizable," Operations Research, INFORMS, vol. 71(5), pages 1857-1870, September.
    2. Li, Jiangtao & Tang, Rui, 2017. "Every random choice rule is backwards-induction rationalizable," Games and Economic Behavior, Elsevier, vol. 104(C), pages 563-567.
    3. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    4. Ray, Indrajit & Snyder, Susan, 2013. "Observable implications of Nash and subgame-perfect behavior in extensive games," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 471-477.
    5. Federico Echenique & Gerelt Tserenjigmid, 2023. "Revealed preferences for dynamically inconsistent models," Papers 2305.14125, arXiv.org, revised Jul 2023.
    6. Nishimura, Hiroki, 2021. "Revealed preferences of individual players in sequential games," Journal of Mathematical Economics, Elsevier, vol. 96(C).
    7. Lee, Byung Soo & Stewart, Colin, 2016. "Identification of payoffs in repeated games," Games and Economic Behavior, Elsevier, vol. 99(C), pages 82-88.
    8. Christopher P. Chambers & Maxime Cugnon de S'evricourt & Christopher Turansick, 2026. "In Search of Lost Correlation: Correlated Equilibrium via Marginal Actions," Papers 2603.02113, arXiv.org.
    9. Carvajal, Andrés, 2024. "Recent advances on testability in economic equilibrium models," Journal of Mathematical Economics, Elsevier, vol. 114(C).
    10. García-Sanz, María D. & Alcantud, José Carlos R., 2015. "Sequential rationalization of multivalued choice," Mathematical Social Sciences, Elsevier, vol. 74(C), pages 29-33.
    11. Christopher P. Chambers & Yusufcan Masatlioglu & Christopher Turansick, 2025. "Revealed Social Networks," Papers 2501.02609, arXiv.org, revised Jun 2025.
    12. Rehbeck, John, 2018. "Note on unique Nash equilibrium in continuous games," Games and Economic Behavior, Elsevier, vol. 110(C), pages 216-225.
    13. Yan Zhao & Yuan Ni, 2022. "The Pricing Strategy of Digital Content Resources Based on a Stackelberg Game," Sustainability, MDPI, vol. 14(24), pages 1-16, December.
    14. Rehbeck, John, 2014. "Every choice correspondence is backwards-induction rationalizable," Games and Economic Behavior, Elsevier, vol. 88(C), pages 207-210.

    More about this item

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
    • D70 - Microeconomics - - Analysis of Collective Decision-Making - - - General

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ecm:emetrp:v:81:y:2013:i:6:p:2521-2534. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/essssea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.