Every Choice Function is Backwards-Induction Rationalizable

Walter Bossert and Yves Sprumont ()

Cahiers de recherche from Universite de Montreal, Departement de sciences economiques

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.

JEL-codes: C72 D70 (search for similar items in EconPapers)
Pages: 16 pages
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://hdl.handle.net/1866/9034 (application/pdf)

Related works:
Journal Article: Every Choice Function Is Backwards‐Induction Rationalizable (2013)
Working Paper: Every Choice Function is Backwards-Induction Rationalizable (2013)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:mtl:montde:2013-01

Access Statistics for this paper

More papers in Cahiers de recherche from Universite de Montreal, Departement de sciences economiques Contact information at EDIRC.
Bibliographic data for series maintained by Sharon BREWER ().