Every Choice Function is Backwards-Induction Rationalizable
| Data(s) |
22/02/2013
22/02/2013
01/01/2013
|
|---|---|
| Resumo |
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. |
| Identificador | |
| Idioma(s) |
en |
| Relação |
Cahier de recherche #2013-01 |
| Tipo |
Article |
