The Complexity of Eliminating Dominated Strategies
From MaRDI portal
Recommendations
- The computational complexity of iterated elimination of dominated strategies
- On the order of eliminating dominated strategies
- Elimination of dominated strategies and inessential players
- Strategy elimination in games with interaction structures
- On the hardness of dominant strategy mechanism design
- Iterated Elimination of Dominated Strategies in a Bertrand-Edgeworth Model
- Strategic complexity in repeated extensive games
- The complexity of synthesizing uniform strategies
- scientific article; zbMATH DE number 1689581
- Dominant strategy implementability and zero length cycles
Cited in
(20)- Perspectives on multiagent learning
- A note on strategy elimination in bimatrix games
- Order independence for iterated weak dominance
- Undominated equilibria in games with strategic complementarities
- Chess-like games are dominance solvable in at most two steps
- Dominant strategy implementability and zero length cycles
- Computer science and decision theory
- On iterated dominance, matrix elimination, and matched paths
- The computational complexity of iterated elimination of dominated strategies
- Effort Games and the Price of Myopia
- On the complexity of iterated weak dominance in constant-sum games
- Determinancy with Complicated Strategies
- scientific article; zbMATH DE number 3949158 (Why is no real title available?)
- Elimination of dominated strategies and inessential players
- On the hardness of dominant strategy mechanism design
- On the complexity of iterated weak dominance in constant-sum games
- The computational complexity of weak saddles
- Computing equilibria: a computational complexity perspective
- On the order of eliminating dominated strategies
- New complexity results about Nash equilibria
This page was built for publication: The Complexity of Eliminating Dominated Strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3140533)
