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.