The role of monotonicity in the epistemic analysis of strategic games
Summary: It is well-known that in finite strategic games true common belief (or common knowledge) of rationality implies that the players will choose only strategies that survive the iterated elimination of strictly dominated strategies. We establish a general theorem that deals with monotonic rationality notions and arbitrary strategic games and allows to strengthen the above result to arbitrary games, other rationality notions, and transfinite iterations of the elimination process. We also clarify what conclusions one can draw for the customary dominance notions that are not monotonic. The main tool is Tarski's fixpoint theorem.
- A lattice-theoretical fixpoint theorem and its applications
- A note on the implications of common knowledge of rationality
- Admissibility in Games
- Agreeing to disagree
- Approximating common knowledge with common beliefs
- General systems and -stable sets --- a formal analysis of socioeconomic environments
- Intrinsic correlation in games
- Iterated strict dominance in general games
- Knowledge spaces with arbitrarily high rank
- On the evaluation of solution concepts
- RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES
- Rationalizability and Correlated Equilibria
- Rationalizability, Learning, and Equilibrium in Games with Strategic Complementarities
- Rationalizable Strategic Behavior
- Rationalizable Strategic Behavior and the Problem of Perfection
- The Many Faces of Rationalizability
- Weak dominance and approximate common knowledge
- Common belief of weak-dominance rationality in strategic-form games: a qualitative analysis
- Strategic candidacy, monotonicity, and strategy-proofness
- On the equivalence between iterated application of choice rules and common belief of applying these rules
- Dominance rationality: a unified approach
- The relation between monotonicity and strategy-proofness
- Rationalizability in general situations
- Fixed points in epistemic game theory
- A dynamic analysis of interactive rationality
- The Many Faces of Rationalizability
- Proof-theoretic analysis of rationality for strategic games with arbitrary strategy sets
- Strategy elimination in games with interaction structures
- A syntactic approach to rationality in games with ordinal payoffs
- AN EPISTEMIC RATIONALE FOR ORDER INDEPENDENCE
- Possibilistic beliefs in strategic games
This page was built for publication: The role of monotonicity in the epistemic analysis of strategic games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2344949)