2009/10/27 by Arno Pauly, Pauly, Arno
Decision Sciences · Computer Science · Economics, Econometrics and Finance · #Game Theory and Applications #Artificial Intelligence in Games #Game Theory and Voting Systems
paper · pdf · doi:10.48550/arxiv.0910.5107
We consider the computational complexity of the question whether a certain strategy can be removed from a game by means of iterated elimination of dominated strategies. In particular, we study the influence of different definitions of domination and of the number of different payoff values. In addition, the consequence of restriction to constant-sum games is shown.