Strategy elimination in games with interaction structures

DOI10.1007/978-3-642-04893-7_24MaRDI QIDQ3655237zbMATH OpenOpenAlexFDO

Authors Andreas Witzel, Krzysztof R. Apt, Jonathan Alexander Zvesper

Publication date 7 January 2010

Published in Logic, Rationality, and Interaction (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04893-7_24

Mathematics Subject Classification ID

(n)-person games, (n>2) (91A06) Rationality and learning in game theory (91A26)

Recommendations

• Knowledge and best responses in games
• Elimination of dominated strategies and inessential players
• Dominated strategies and common knowledge
• The role of monotonicity in the epistemic analysis of strategic games
• Iterated strict dominance in general games

Cited in

(6)

• Hypergraphs, local reasoning, and weakly aggregative modal logic
• The Complexity of Eliminating Dominated Strategies
• Elimination of dominated strategies and inessential players
• Someone knows that local reasoning on hypergraphs is a weakly aggregative modal logic
• Directed elimination games
• On the order of eliminating dominated strategies

This page was built for publication: Strategy elimination in games with interaction structures

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