Finite Perfect Information Extensive Games with Generic Payoffs

In finite perfect information extensive (FPIE) games, backward induction (BI) gives rise to all pure-strategy subgame perfect Nash equilibria, and iterative elimination of weakly dominated strategies (IEWDS) may give different outcomes for different orders of elimination. Duggan recently posed several conjectures in an effort to better understand the relationship between BI and IEWDS in FPIE games. One conjecture states that the unique BI strategy profile in FPIE games with generic payoffs is guaranteed to survive IEWDS when all weakly dominated strategies are eliminated at every round. This paper exhibits a counterexample to this conjecture.