Relative Strength of Strategy Elimination Procedures
Computer Science and Game Theory
2007-06-13 v1
Abstract
We compare here the relative strength of four widely used procedures on finite strategic games: iterated elimination of weakly/strictly dominated strategies by a pure/mixed strategy. A complication is that none of these procedures is based on a monotonic operator. To deal with this problem we use 'global' versions of these operators.
Keywords
Cite
@article{arxiv.0706.1617,
title = {Relative Strength of Strategy Elimination Procedures},
author = {Krzysztof R. Apt},
journal= {arXiv preprint arXiv:0706.1617},
year = {2007}
}