Dominated strategies and common knowledge
From MaRDI portal
Publication:1189705
DOI10.1016/0899-8256(92)90020-SzbMATH Open0749.90092OpenAlexW3122651218MaRDI QIDQ1189705FDOQ1189705
Authors: Larry Samuelson 
Publication date: 27 September 1992
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0899-8256(92)90020-s
Recommendations
Cites Work
- Title not available (Why is that?)
- On the Strategic Stability of Equilibria
- The theory of social situations. A game-theoretic approach.
- The Bayesian foundations of solution concepts of games
- Agreeing to disagree
- Title not available (Why is that?)
- Title not available (Why is that?)
- Rationalizable Strategic Behavior and the Problem of Perfection
- Rationalizable Strategic Behavior
- Perfect and proper equilibria of large games
- Rational behavior with payoff uncertainty
- Title not available (Why is that?)
- Perfect equilibrium histories of finite and infinite horizon games
Cited In (49)
- Undominated equilibria in games with strategic complementarities
- Rationalizability and logical inference
- Chess-like games are dominance solvable in at most two steps
- Optimism and pessimism in strategic interactions under ignorance
- Dominance solvable English matching auctions.
- ``Cautious utility maximation and iterated weak dominance
- Strategic cautiousness as an expression of robustness to ambiguity
- Common assumption of rationality
- Cautious belief and iterated admissibility
- Lexicographic agreeing to disagree and perfect equilibrium
- Admissibility in Games
- An epistemic characterization of MACA
- On the complexity of iterated weak dominance in constant-sum games
- Comprehensive rationalizability
- A dynamic analysis of interactive rationality
- Admissibility and assumption
- On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
- The power of paradox: some recent developments in interactive epistemology
- Algorithms for cautious reasoning in games
- Lexicographic rationalizability and iterated admissibility
- Admissibility and common belief.
- Adaptive learning and iterated weak dominance
- Iterative information update and stability of strategies
- Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information
- The role of aggregate information in a binary threshold game
- Weak assumption and iterative admissibility
- On the epistemic foundation for iterated weak dominance: an analysis in a logic of individual and collective attitudes
- An ordinal minimax theorem
- Cournot tâtonnement and dominance solvability in finite games
- Self-admissible sets
- Title not available (Why is that?)
- On the foundation of stability
- Responsive and strong responsive evolutionary dynamics
- The reasoning-based expected utility procedure
- The epistemic structure of a theory of a game
- Stable equilibrium in beliefs in extensive games with perfect information
- Order independence for iterated weak dominance
- Iterated strict dominance in general games
- Knowledge and best responses in games
- Weak belief and permissibility
- The foundation of stability in extensive games with perfect information
- Strategy elimination in games with interaction structures
- The computational complexity of weak saddles
- The trembling chairman paradox
- Simple mechanisms and preferences for honesty
- Common knowledge of payoff uncertainty in games
- The theory of normal form games from the differentiable viewpoint
- A minimal logic for interactive epistemology
- Scoring rule voting games and dominance solvability
This page was built for publication: Dominated strategies and common knowledge
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1189705)
