On the complexity of iterated weak dominance in constant-sum games

DOI10.1007/s00224-010-9282-7zbMath1278.91012MaRDI QIDQ647483

Felix Fischer, Markus Brill, Paul Harrenstein, Felix Brandt

Publication date: 23 November 2011

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-010-9282-7

zbMATH Keywords

computational complexity; iterated weak dominance; constant-sum games; solutions concepts

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

91A10: Noncooperative games

91A05: 2-person games

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

The computational complexity of iterated elimination of dominated strategies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the equivalence of weak dominance and sequential best response
• Ranking games
• Dominated strategies and common knowledge
• The complexity of two-person zero-sum games in extensive form
• Order independence for iterated weak dominance
• Iterated weak dominance in strictly competitive games of perfect information.
• The Complexity of Eliminating Dominated Strategies
• Rationalizable Strategic Behavior and the Problem of Perfection
• Rationalizable Strategic Behavior
• Multiagent Systems
• On the Strategic Stability of Equilibria
• Market News in Commodity Price Theory: Application to the Ethiopian Grain Market
• Admissibility in Games