Existence and Uniqueness of Maximal Reductions Under Iterated Strict Dominance

From MaRDI portal
Revision as of 03:56, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5475015


DOI10.1111/1468-0262.00360zbMath1141.91311MaRDI 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


91A10: Noncooperative games

91A06: (n)-person games, (n>2)

91A07: Games with infinitely many players

91A26: Rationality and learning in game theory


Related Items

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