Sciweavers

Share
SIGECOM
2005
ACM

Complexity of (iterated) dominance

10 years 3 months ago
Complexity of (iterated) dominance
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 also show that determining whether there is a path that leads to a unique solution is NP-complete. Both of these results hold both with and without dominance by mixed strategies. (A weaker version of the second result (only without dominance by mixed strategies) was already known [7].) Iterated strict dominance, on the other hand, is path-independent (both with and without dominance by mixed strategies) and can therefore be done in polynomial time. We then study what happens when the dominating s...
Vincent Conitzer, Tuomas Sandholm
Added 26 Jun 2010
Updated 26 Jun 2010
Type Conference
Year 2005
Where SIGECOM
Authors Vincent Conitzer, Tuomas Sandholm
Comments (0)
books