ICEF Research Seminar by Andrés Perea (Maastricht University)
Speaker: Andrés Perea (Maastricht University)
Theme: "Why Forward Induction Leads to the Backward Induction Outcome: A New Proof for Battigalli’s Theorem"
Abstract: Battigalli (1997) has shown that in dynamic games with perfect information and without relevant ties, the forward induction concept of extensive-form rationalizability yields the backward induction outcome. In this talk I provide a new proof for this remarkable result, based on four steps. I first show that extensive-form rationalizability can be characterized by the iterated application of a special reduction operator, the strong belief reduction operator. I next prove that this operator satisfies a mild version of monotonicity, which we call monotonicity on reachable histories. This property is used to show that for this operator, every possible order of elimination leads to the same set of outcomes. I finally show that backward induction yields a possible order of elimination for the strong belief reduction operator. These four properties together imply Battigalli's theorem.