Permalink: http://hdl.handle.net/1866/9034
Every Choice Function is Backwards-Induction Rationalizable
Article [Version of Record]
Is part of
Cahier de recherche ; no. 2013-01.Publisher(s)
Université de Montréal. Département de sciences économiques.Abstract(s)
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.