Iterated dominance in quasisupermodular games with strict single crossing property

Abstract.

We show that in quasisupermodular games that satisfy strict single crossing property the least and greatest undominated Nash-equilibrium can be reached by iteratively eliminating dominated strategies. In the first round all weakly dominated strategies are eliminated. In the successive rounds all strictly dominated strategies are iteratively eliminated.