Location of Repository

In game theory, a player’s action is said to be weakly dominated if there exists another action 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 NPcomplete. 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 Conitzer and Sandholm by showing that typical problems associated with IWD in win-lose games with at most one winner are NP-complete

Topics:
Weak Dominance · Computational Complexity

Year: 2010

OAI identifier:
oai:CiteSeerX.psu:10.1.1.186.1124

Provided by:
CiteSeerX

Download PDF:To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.