Iterated Elimination of Dominated Mixed Strategies
summary
The gist
This note compares two iterated dominance procedures, one based on eliminating mixed strategies and one based on eliminating pure strategies, showing that in compact and continuous games…
In short
This work compares two ways to eliminate dominated strategies: one using mixed strategies and one using pure strategies. It proves that in compact, continuous games, the mixed-strategy procedure can trail the pure-strategy procedure by at most one round. This establishes a tight bound on the difference between these two methods for finding undominated strategies.
Key concepts
- Iterated Dominance
- This is a process used to eliminate strategies that are strictly worse than others, applied repeatedly. The paper examines this process when applied to mixed strategies versus pure ones, showing how closely they track each other in continuous games.
- Grandfather Dominance
- An intermediate concept introduced to show that iterated dominance based on mixed strategies is equivalent to a specific type of grandfather dominance. This links the two procedures together, simplifying the analysis of how one procedure relates to the other.
- Support Dominance
- An alternative procedure that focuses only on checking for improvements relative to a set of opponents' pure strategies rather than all previously undominated mixed strategies. This offers a potentially more computationally efficient way to find undominated mixed strategies.
- Termination Conditions
- These are the specific rules that determine when the elimination procedures stop. For compact and continuous games, both procedures are guaranteed to stop at the first limit ordinal, characterized by stabilization after a finite number of rounds or meeting specific set conditions.
Terminology used across episodes
This episode discusses
The paper
Iterated Elimination of Dominated Mixed Strategies · Read on arXiv
Federico Echenique, Amanda Friedenberg
Transcript
Introduction to the show: ident: Economics. The day in economics: theory, mechanisms and the evidence beneath them.
Ruth: We're looking at the paper: "Iterated Elimination of Dominated Mixed Strategies".
Warren: Here's the gist of the paper. This note compares two iterated dominance procedures, one based on eliminating mixed strategies and one based on eliminating pure strategies, showing that in compact and continuous games, the mixed-strategy procedure can trail the pure-strategy procedure by at most one round.
Ruth: The Core Finding In any compact and continuous game, the mixed-strategy elimination procedure can trail the pure-strategy procedure by at most one step, meaning if the pure-strategy procedure terminates at round M, the mixed-strategy procedure will either terminate at M or M + 1.
Warren: This bound is tight.
Ruth: Conceptual Framework and Equivalence The paper introduces "grandfather dominance" as an intermediate concept, which shows that iterated dominance based on mixed strategies is round-for-round equivalent to iterated grandfather dominance.
Paper summary: Ruth: To get into specifics on the paper, "Iterated Elimination of Dominated Mixed Strategies," it compares two procedures: one based on eliminating mixed strategies and one based on eliminating pure strategies. The central claim is that for compact and continuous games, the mixed-strategy procedure can trail the pure-strategy procedure by at most one round, meaning if pure strategy elimination takes M rounds, mixed strategy elimination takes M or M plus one >
Warren: And this bound is tight because they show that this lag actually happens in certain cases >
Iris: The paper also introduces concepts like "iterated support dominance," which they say is round-for-round equivalent to both iterated dominance and iterated grandfather dominance, and it only requires searching for improvements relative to a set of the opponents' pure strategies >
Ruth: And this equivalence means that you can use these other procedures instead of the main one if you want a more focused search; it simplifies how we think about finding those undominated mixed strategies >
Warren: It suggests that instead of dealing with the whole, potentially much larger set of previously undominated mixed strategies, you can focus on what’s relevant to the current stage using these support dominance ideas >
Iris: The termination conditions they establish are also pretty clean; for compact and continuous games, both procedures stop shrinking at the first limit ordinal, meaning they are guaranteed to halt eventually >
Ruth: And what's really interesting is that if you look at the characterization of undominated strategies, it relates them directly to those not dominated relative to all pure strategies that can get strictly positive probability under a strategy in a previously undominated set >
Warren: That sounds like a way to make the search more targeted; checking against the supports of sets rather than every single mixed strategy available >
Iris: The paper proves an equivalence between the set of m-undominated mixed strategies and the m-grandfather undominated strategies by showing that a strategy is in one if and only if its characteristic function satisfies certain properties related to improvements over the set at round m minus i >
Ruth: So, ultimately, this work provides a way to compute those undominated mixed strategies by searching for improvements relative to just the (m minus one)-undominated pure strategies instead of the larger set of all (m minus one)-undominated mixed strategies >
Conclusion: Ruth: So, to wrap up, this paper "Iterated Elimination of Dominated Mixed Strategies" establishes that in compact and continuous games, the mixed-strategy elimination procedure can trail the pure-strategy procedure by at most one round >
Warren: That tight bound is pretty significant because it directly addresses the inference problem when players choose stochastic strategies; it shows a potential large disconnect between the number of rounds needed for pure versus mixed strategy elimination >
Iris: It also offers an alternative characterization of m-undominated mixed strategies based on support dominance, which requires searching only relative to the (m minus one)-undominated pure strategies instead of the larger set of all previously undominated mixed strategies >
Ruth: And if you see that the procedure based on mixed strategies terminates in finitely many rounds, then so does the procedure based on pure strategies; they are equivalent in that way >
Warren: So, if one procedure stops, the other one stops too; it implies that for these specific games, you don't need to worry about a massive gap between them stopping times >
More episodes
- Daily Summary for 2026-11-19
- 2608.21274-Recommendation Quality and the Concentration of Consumption: Experimental Evidence from Netflix
- 2408.02757-A nonparametric test for diurnal variation in spot correlation processes
- 2306.16393-High-Dimensional Canonical Correlation Analysis
- 2605.17299-Geometric Brownian motion with intermittent entries and exits
- 2607.04753-Fooling Yourself: how narratives shape beliefs
- 2408.14671-Inference on Treatment Effects with Repeatedly Mismeasured High-Dimensional Controls
- 2201.06898-Difference-in-Differences Estimators for Treatments Continuously Distributed at Every Period
- 2501.15307-Influence Functions: A Unified Differentiation-Based Framework
- The day in conversation for 2026-11-19