Pages that link to "Item:Q1189705"

The following pages link to Dominated strategies and common knowledge (Q1189705):

Displaying 47 items.

• Admissibility and assumption (Q281332) (← links)
• Cournot tâtonnement and dominance solvability in finite games (Q423893) (← links)
• A minimal logic for interactive epistemology (Q516245) (← links)
• Iterative information update and stability of strategies (Q542135) (← links)
• The reasoning-based expected utility procedure (Q632953) (← links)
• On the complexity of iterated weak dominance in constant-sum games (Q647483) (← links)
• The computational complexity of weak saddles (Q647484) (← links)
• Lexicographic rationalizability and iterated admissibility (Q674075) (← links)
• The power of paradox: some recent developments in interactive epistemology (Q878162) (← links)
• Weak assumption and iterative admissibility (Q896939) (← links)
• Common knowledge of payoff uncertainty in games (Q934775) (← links)
• Self-admissible sets (Q969128) (← links)
• On the foundation of stability (Q1028547) (← links)
• The foundation of stability in extensive games with perfect information (Q1049232) (← links)
• ``Cautious'' utility maximation and iterated weak dominance (Q1196700) (← links)
• Adaptive learning and iterated weak dominance (Q1288242) (← links)
• Responsive and strong responsive evolutionary dynamics (Q1327068) (← links)
• The epistemic structure of a theory of a game (Q1330010) (← links)
• The theory of normal form games from the differentiable viewpoint (Q1332125) (← links)
• Knowledge and best responses in games (Q1339218) (← links)
• Order independence for iterated weak dominance (Q1357404) (← links)
• Undominated equilibria in games with strategic complementarities (Q1367682) (← links)
• Admissibility and common belief. (Q1395583) (← links)
• Chess-like games are dominance solvable in at most two steps (Q1593744) (← links)
• Rationalizability and logical inference (Q1651238) (← links)
• Dominance solvable English matching auctions. (Q1867792) (← links)
• Comprehensive rationalizability (Q2002361) (← links)
• Characterizing permissibility, proper rationalizability, and iterated admissibility by incomplete information (Q2021790) (← links)
• The trembling chairman paradox (Q2078032) (← links)
• Optimism and pessimism in strategic interactions under ignorance (Q2100661) (← links)
• An epistemic characterization of MACA (Q2143888) (← links)
• Weak belief and permissibility (Q2178012) (← links)
• Algorithms for cautious reasoning in games (Q2280049) (← links)
• Strategic cautiousness as an expression of robustness to ambiguity (Q2291171) (← links)
• The role of aggregate information in a binary threshold game (Q2417363) (← links)
• Simple mechanisms and preferences for honesty (Q2437181) (← links)
• On the epistemic foundation for iterated weak dominance: an analysis in a logic of individual and collective attitudes (Q2441476) (← links)
• Scoring rule voting games and dominance solvability (Q2452252) (← links)
• Iterated strict dominance in general games (Q2462288) (← links)
• A Dynamic Analysis of Interactive Rationality (Q3094011) (← links)
• (Q5018514) (← links)
• Stable equilibrium in beliefs in extensive games with perfect information (Q5941433) (← links)
• An ordinal minimax theorem (Q5964692) (← links)
• Common assumption of rationality (Q6146428) (← links)
• Lexicographic agreeing to disagree and perfect equilibrium (Q6146438) (← links)
• Cautious belief and iterated admissibility (Q6146449) (← links)
• On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC (Q6581796) (← links)