Complexity of (iterated) dominance

@inproceedings{Conitzer2005ComplexityO,
  title={Complexity of (iterated) dominance},
  author={Vincent Conitzer and Tuomas Sandholm},
  booktitle={EC},
  year={2005}
}
We study various computational aspects of solving games using dominance and iterated dominance. We first study both strict and weak dominance (not iterated), and show that checking whether a given strategy is dominated by some mixed strategy can be done in polynomial time using a single linear program solve. We then move on to iterated dominance. We show that determining whether there is some path that eliminates a given strategy is NP-complete with iterated weak dominance. This allows us to… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 38 CITATIONS

On the parameterized complexity of dominant strategies

VIEW 12 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

On the Complexity of Iterated Weak Dominance in Constant-Sum Games

VIEW 7 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Complexity results for some classes of strategic games

VIEW 8 EXCERPTS
CITES BACKGROUND, METHODS & RESULTS
HIGHLY INFLUENCED

Ranking games

VIEW 10 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Parameterized Complexity News 3 Parameterized Complexity and Nash Equilibrium

Yiannis Koutis
    VIEW 9 EXCERPTS
    CITES BACKGROUND & METHODS
    HIGHLY INFLUENCED

    References

    Publications referenced by this paper.