On the Complexity of Iterated Weak Dominance in Constant-Sum Games
- 68 Downloads
In game theory, an action is said to be weakly dominated if there exists another action of the same player that, with respect to what the other players do, is never worse and sometimes strictly better. We investigate the computational complexity of the process of iteratively eliminating weakly dominated actions (IWD) in two-player constant-sum games, i.e., games in which the interests of both players are diametrically opposed. It turns out that deciding whether an action is eliminable via IWD is feasible in polynomial time whereas deciding whether a given subgame is reachable via IWD is NP-complete. The latter result is quite surprising, as we are not aware of other natural computational problems that are intractable in constant-sum normal-form games. Furthermore, we slightly improve on a result of V. Conitzer and T. Sandholm by showing that typical problems associated with IWD in win-lose games with at most one winner are NP-complete.
KeywordsGame theory Constant-sum games Solutions concepts Iterated weak dominance Computational complexity
Unable to display preview. Download preview PDF.
- 1.Apt, K.R.: Uniform proofs of order independence for various strategy elimination procedures. Contrib. Theor. Econ. 4(1) (2004) Google Scholar
- 4.Brandt, F., Brill, M., Fischer, F., Harrenstein, P., Hoffmann, J.: Computing Shapley’s saddles, ACM SIGecom Exchanges 8(2) (2009) Google Scholar
- 14.Osborne, M.: An Introduction to Game Theory. University Press, Oxford (2004) Google Scholar