The computational complexity of iterated elimination of dominated strategies

DOI10.1007/s00224-015-9637-1zbMath1346.91005OpenAlexW759361896MaRDI QIDQ315527

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)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the complexity of iterated weak dominance in constant-sum games
• On the order of eliminating dominated strategies
• A note on strategy elimination in bimatrix games
• The relative complexity of NP search problems
• Order independence for iterated weak dominance
• Corrigendum: Order independence for iterated weak dominance
• The Complexity of Eliminating Dominated Strategies
• Rationalizable Strategic Behavior and the Problem of Perfection
• Rationalizable Strategic Behavior
• The Complexity of Computing a Nash Equilibrium
• AN EPISTEMIC RATIONALE FOR ORDER INDEPENDENCE

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