The Complexity of Eliminating Dominated Strategies

DOI10.1287/moor.18.3.553zbMath0790.90084OpenAlexW2002481951MaRDI QIDQ3140533

Itzhak Gilboa, Ehud Kalai, Eitan Zemel

Publication date: 28 November 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://www.kellogg.northwestern.edu/research/math/papers/853.pdf

zbMATH Keywords

strong dominationweak domination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (10)

The computational complexity of iterated elimination of dominated strategies ⋮ Computing equilibria: a computational complexity perspective ⋮ Order independence for iterated weak dominance ⋮ Undominated equilibria in games with strategic complementarities ⋮ On the complexity of iterated weak dominance in constant-sum games ⋮ The computational complexity of weak saddles ⋮ New complexity results about Nash equilibria ⋮ Computer science and decision theory ⋮ Effort Games and the Price of Myopia ⋮ Perspectives on multiagent learning

This page was built for publication: The Complexity of Eliminating Dominated Strategies