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.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received January 1997/Final version June 1997
Rights and permissions
About this article
Cite this article
Kultti, K., Salonen, H. Iterated dominance in quasisupermodular games with strict single crossing property. Game Theory 27, 305–309 (1998). https://doi.org/10.1007/s001820050074
Issue Date:
DOI: https://doi.org/10.1007/s001820050074