The Complexity of Iterated Strategy Elimination
classification
💻 cs.CC
cs.GT
keywords
complexitydifferenteliminationiteratedstrategyadditioncertaincomputational
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.