We show that for solvable games, the calculation of the strategies which survive iterative elimination of dominated strategies in normal games is equivalent to the calculation of the backward induction outcome of some extensive game. However, whereas the normal game form does not provide information on how to carry out the elimination, the corresponding extensive game does. As a by-product, we conclude that implementation using a subgame perfect equilibrium of an extensive game with perfect

more »

... rmation is equivalent to implementation through a solution concept which we call guided iteratively elimination of dominated strategies which requires a uniform order of elimination.