Search
Now showing items 1-1 of 1
Every Choice Function is Backwards-Induction Rationalizable
(Université de Montréal. Département de sciences économiques., 2013-01)
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 ...