Every Choice Function Is Backwards-Induction Rationalizable
证明了任何选择函数都可以通过一个有限完美信息扩展式博弈的逆向归纳结果来理性化，即对每个备选子集，博弈限制后的逆向归纳结果与选择函数的选择一致。
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.