On the order of eliminating dominated strategies

DOI10.1016/0167-6377(90)90046-8zbMATH Open0696.90091OpenAlexW1969363584MaRDI QIDQ911490FDOQ911490

Itzhak Gilboa, Ehud Kalai, Eitan Zemel

Publication date: 1990

Published in: Operations Research Letters (Search for Journal in Brave)

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

Recommendations

• The Complexity of Eliminating Dominated Strategies
• Elimination of dominated strategies and inessential players
• The computational complexity of iterated elimination of dominated strategies
• Iterated Elimination of Dominated Strategies in a Bertrand-Edgeworth Model
• Strategy elimination in games with interaction structures
• Dominant strategy implementability and zero length cycles
• Iterative elimination of weakly dominated strategies in binary voting agendas with sequential voting
• Dominated strategies in searching for evolutionary stable strategies
• The order independence of iterated dominance in extensive games
• Iterated strict dominance in general games

zbMATH Keywords

dominated strategiesreduced game

Mathematics Subject Classification ID

Noncooperative games (91A10)

Cites Work

• Title not available (Why is that?)
• Dominance Solvable Voting Schemes
• On the Strategic Stability of Equilibria
• Title not available (Why is that?)
• Title not available (Why is that?)
• A note on strategy elimination in bimatrix games
• Title not available (Why is that?)

Cited In (22)

• Rationalizability and logical inference
• Chess-like games are dominance solvable in at most two steps
• Iterated elimination procedures
• Iterated bounded dominance
• The Complexity of Eliminating Dominated Strategies
• COALITION-PROOF NASH EQUILIBRIA IN A NORMAL-FORM GAME AND ITS SUBGAMES
• Order independence for rationalizability
• Game theory with translucent players
• Lexicographic rationalizability and iterated admissibility
• Elimination of dominated strategies and inessential players
• Dominance rationality: a unified approach
• Iterative information update and stability of strategies
• Existence and Uniqueness of Maximal Reductions Under Iterated Strict Dominance
• The computational complexity of iterated elimination of dominated strategies
• Cournot tâtonnement and dominance solvability in finite games
• Comparing the notions of optimality in CP-nets, strategic games and soft constraints
• Responsive and strong responsive evolutionary dynamics
• A note on strategy elimination in bimatrix games
• Title not available (Why is that?)
• Order independence for iterated weak dominance
• Iterated strict dominance in general games
• Dominant strategy implementability and zero length cycles

This page was built for publication: On the order of eliminating dominated strategies

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