The computational complexity of iterated elimination of dominated strategies

DOI10.1007/S00224-015-9637-1MaRDI QIDQ315527zbMATH OpenOpenAlexFDO

Authors Arno Pauly

Publication date 21 September 2016

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

Full work available at URL https://cronfa.swan.ac.uk/Record/cronfa36018

zbMATH Keywords

computational complexitydominated strategiesnormal form gamestrategy elimination

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 2-person games (91A05)

Recommendations

• The Complexity of Eliminating Dominated Strategies
• Iterated elimination procedures
• On the complexity of iterated weak dominance in constant-sum games
• On iterated dominance, matrix elimination, and matched paths
• On the complexity of iterated weak dominance in constant-sum games

Cites work

• scientific article; zbMATH DE number 4011963 (Why is no real title available?)
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• A course in game theory.
• A note on strategy elimination in bimatrix games
• AN EPISTEMIC RATIONALE FOR ORDER INDEPENDENCE
• Corrigendum: Order independence for iterated weak dominance
• How incomputable is finding Nash equilibria?
• On the complexity of iterated weak dominance in constant-sum games
• On the order of eliminating dominated strategies
• Order independence for iterated weak dominance
• Rationalizable Strategic Behavior
• Rationalizable Strategic Behavior and the Problem of Perfection
• The Complexity of Eliminating Dominated Strategies
• The complexity of computing a Nash equilibrium
• The complexity of finding Nash equilibria
• The relative complexity of NP search problems

Cited in

(8)

• On iterated dominance, matrix elimination, and matched paths
• The Complexity of Eliminating Dominated Strategies
• On the complexity of iterated weak dominance in constant-sum games
• On the complexity of iterated weak dominance in constant-sum games
• The complexity of admissibility in omega-regular games
• On the order of eliminating dominated strategies
• Dominant strategy implementability and zero length cycles
• scientific article; zbMATH DE number 7533335 (Why is no real title available?)

This page was built for publication: The computational complexity of iterated elimination of dominated strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315527)