infonet-economy

We prove that any strictly competitive perfect-information two-person game with n outcomes is solvable in n−1 steps of elimination of weakly dominated strategies— regardless of the length of the game tree. The given bound is shown to be tight using a variant of Rosenthal's centipede game.