Existence and Uniqueness of Maximal Reductions Under Iterated Strict Dominance

DOI10.1111/1468-0262.00360zbMath1141.91311OpenAlexW1995714903MaRDI QIDQ5475015

Mark Stegeman, Martin Dufwenberg

Publication date: 16 June 2006

Published in: Econometrica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1468-0262.00360

Mathematics Subject Classification ID

Noncooperative games (91A10) (n)-person games, (n>2) (91A06) Games with infinitely many players (91A07) Rationality and learning in game theory (91A26)

Related Items

Common belief in rationality in psychological games. Belief-dependent utility and the limits of strategic reasoning, Bounded depths of rationality and implementation with complete information, Reasonable Nash demand games, Interim correlated rationalizability in infinite games, Formalizing common belief with no underlying assumption on individual beliefs, Coalitional strategic games, Common knowledge and limit knowledge, The existence of universal qualitative belief spaces, Iterated bounded dominance, Order independence for rationalizability, Unique stable matchings, Rationalizability in games with a continuum of players, Cournot tâtonnement and dominance solvability in finite games, Irresolute mechanism design: a new path to possibility, The reasoning-based expected utility procedure, Iterated elimination procedures, Simple mechanisms and preferences for honesty, An indistinguishability result on rationalizability under general preferences, A new necessary condition for implementation in iteratively undominated strategies, Iterated strict dominance in general games, AN EPISTEMIC RATIONALE FOR ORDER INDEPENDENCE, The context of the game, On the equivalence between iterated application of choice rules and common belief of applying these rules, On the equivalence of weak dominance and sequential best response, Bayesian coalitional rationalizability, Dominance rationality: a unified approach, Iterated dominance revisited, Bayesian persuasion in unlinked games, Static search games played over graphs and general metric spaces