Every choice function is backwards-induction rationalizable

• Autores: Walter Bossert, Yves Sprumont
• Localización: Econométrica: Journal of the Econometric Society, ISSN 0012-9682, Vol. 81, Nº 6, 2013, págs. 2521-2534
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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. [PUBLICATION ABSTRACT]