Iterated elimination of dominated strategies is a Game Theory method for solving a game by repeatedly removing strategies that are always worse than another strategy. It narrows the game to the choices a rational player would still consider.
Iterated elimination of dominated strategies is a way to simplify a Game Theory problem by crossing out strategies a rational player would never choose. A strategy is dominated if another strategy gives that player at least as much payoff in every case, and more payoff in some cases. Once one dominated strategy is removed, that can make other strategies dominated too, so you keep checking again and again.
That repeated checking is what makes the process “iterated.” You do not just eliminate one bad option and stop. You remove the clearly inferior choices, then re-evaluate the smaller game to see whether new eliminations appear. This is why the process can shrink a messy game matrix into a much smaller set of plausible moves.
A simple game matrix makes this easier to see. Suppose one row gives a player lower payoffs than another row no matter what the opponent picks. That row is dominated, so it can be eliminated. After that row disappears, the remaining rows and columns may reveal another strategy that used to look fine but is now obviously worse than the alternatives.
There are two common versions of domination: strict and weak. Strict domination means one strategy is always worse than another, with no exceptions. Weak domination means it is never better and sometimes worse. In class problems, you usually watch carefully for which version the instructor allows, because weak dominance can make elimination order more delicate.
The big idea is that iterated elimination does not guess what will happen. It filters out choices that do not survive rational comparison. In many games, that leaves a tiny set of strategies, and sometimes only one outcome remains. In other games, the process stops before you get a single answer, so you need another tool like Nash equilibrium to finish the analysis.
This term matters because it gives you a fast way to solve and interpret strategic games without checking every possible outcome by brute force. In Game Theory, games often start as tables with several rows and columns, and iterated elimination helps you reduce that table step by step until only credible strategies remain.
That makes it a bridge between raw payoff data and higher-level ideas like Nash equilibrium and rational choice. If a strategy is dominated, a rational player has no reason to keep it in the running, so the elimination process matches the course’s assumption that players respond intelligently to payoffs. It also shows why the order of elimination can matter in some games, especially when weak dominance is involved.
You will see this concept in problem sets where you are asked to mark off dominated rows or columns, explain why a strategy can be removed, or use the reduced game to predict likely behavior. It also comes up in classic examples like the Battle of the Sexes, where there is more than one plausible outcome and strategic simplification helps organize the analysis.
Keep studying Game Theory Unit 3
Visual cheatsheet
view galleryDominant Strategy
A dominant strategy is the opposite side of the same idea. Instead of being worse than another strategy, it is at least as good as every alternative no matter what the other player does. When you study iterated elimination, you are usually looking for strategies that fail this test and can be removed from the game matrix.
Nash Equilibrium
Iterated elimination often helps you narrow down the strategies that could be part of a Nash equilibrium. After dominated options are removed, the remaining game is smaller and easier to check for best responses. But the process does not always produce a unique equilibrium, so you still need equilibrium reasoning after the pruning step.
Game Matrix
The game matrix is where you actually carry out iterated elimination. You compare payoffs across rows or columns, identify one strategy that is always worse than another, and cross it out. A smaller matrix can reveal patterns that were harder to see in the original version.
Order Independence
Order independence asks whether you get the same final result no matter which dominated strategies you eliminate first. That question matters because some games, especially with weakly dominated strategies, can change depending on the elimination sequence. If your class discusses this, it is usually about whether the reduced game is stable or sensitive to the order of steps.
A problem set question will usually give you a payoff matrix and ask you to eliminate dominated strategies step by step. Your job is to compare payoffs across rows or columns, justify each elimination, and then use the reduced game to identify the remaining outcomes. If the game does not collapse to one answer, you may need to check whether a Nash equilibrium is still present in the surviving strategies.
On quizzes, the tricky part is often spotting domination after a first elimination changes the game. You are not just marking the first obvious loser, you are re-checking the matrix each time the set of choices shrinks. In a written response, explain each step clearly, since the reasoning matters as much as the final reduced matrix.
A dominant strategy is a strategy that beats or matches every alternative for a player. Iterated elimination of dominated strategies is the process of removing strategies that do not meet that standard. One is a property of a strategy, the other is a procedure for simplifying the whole game.
Iterated elimination of dominated strategies removes strategies that are always worse than another strategy, then repeats the check on the smaller game.
You use it to simplify a game matrix and rule out choices a rational player would not keep.
Strict domination is easier to work with than weak domination, because weakly dominated strategies can make the elimination order matter.
The process can narrow a game enough to make a Nash equilibrium easier to spot, but it does not always produce a single final answer.
When you apply it, show each comparison clearly so you can justify why each row or column gets removed.
It is a step-by-step method for shrinking a strategic game by removing strategies that are always worse than another strategy for the same player. After one elimination, you check the reduced game again, because new dominated strategies can appear. The goal is to leave only the choices that still make sense for a rational player.
Compare one strategy to another strategy for the same player across every possible action by the opponent. If the second strategy gives at least as much payoff in every case and sometimes more, the first strategy is dominated. In matrix problems, that usually means comparing rows or columns payoff by payoff.
A dominant strategy is a single strategy that is best or tied for best against every opponent choice. Iterated elimination is the procedure you use when some strategies are clearly worse and can be removed. So a dominant strategy is a result or property, while iterated elimination is the method.
No. Sometimes the reduced game leaves one outcome that matches a Nash equilibrium, but other times several strategies remain and you still have to analyze best responses. The method is a simplifier, not a guarantee that the game will collapse to one answer.