Iterative elimination is a Game Theory method for repeatedly removing dominated strategies from a game. It narrows the strategy set to options that can still matter for rational choice and equilibrium analysis.
Iterative elimination is a way of simplifying a game in Game Theory by removing dominated strategies one round at a time. A strategy is dominated if there is another strategy that gives a player a better payoff no matter what the other players do. Once you spot that kind of strategy, you can eliminate it and then check the smaller game again for more dominated options.
This is not just a shortcut for cleanup. In many games, a strategy only looks acceptable until you remove another strategy first. After that first elimination, a new option may become obviously worse than the remaining ones. That is why the process is iterative: you repeat it until no more dominated strategies are left.
A simple way to picture it is like trimming a decision tree. At the start, a game may have several rows and columns of possible moves, which can feel messy if you are trying to reason through every outcome. Iterative elimination cuts away the moves that a rational player would never pick because they are always beaten by some other move.
The strongest version of the idea is based on strict domination, where one strategy is worse in every possible case. In many classes, you may also see weak domination, where one strategy is never better and sometimes worse. The difference matters because weakly dominated strategies can create more ambiguity, and different elimination orders can sometimes lead to different results.
A worked example usually looks like a payoff matrix. You compare each strategy against the alternatives, check whether one row or column is always lower for a player, eliminate it, and then re-check the reduced matrix. If the remaining strategies point toward a single outcome, that outcome can line up with a Nash Equilibrium, but iterative elimination does not guarantee that you will end with just one choice or one equilibrium.
The big idea is that rational players avoid obviously inferior moves, and iterative elimination turns that principle into a step-by-step method you can actually apply.
Iterative elimination shows how Game Theory turns the broad idea of rational choice into a concrete procedure. Instead of trying to compare every possible combination of moves in a large game, you shrink the game by removing strategies that no rational player would keep. That makes it easier to spot patterns in payoff matrices, especially when several players are making decisions at the same time.
It also gives you a bridge to other core ideas in the course. If you can eliminate enough dominated strategies, the remaining choices may point toward a Nash Equilibrium or reveal which moves are best responses to each other. Even when it does not produce a single answer, the process still tells you which strategies survive basic rational scrutiny.
This matters a lot in multi-player games, where the full strategy list can get unwieldy fast. Iterative elimination lets you focus on the moves that are actually worth analyzing instead of treating every option as equally plausible. That is a skill you use again and again when solving game matrices, reading strategic scenarios, or explaining why a player would avoid a certain move.
It also helps you notice a common misconception: a strategy can be part of the game and still be irrelevant if it is dominated. Game Theory is often less about finding the “best” move in a vague sense and more about ruling out moves that cannot be defended as rational. That is exactly what iterative elimination does.
Keep studying Game Theory Unit 1
Visual cheatsheet
view galleryDominated Strategy
Iterative elimination starts with dominated strategies. You first identify a move that is worse than another move for a player, no matter what the others do, and then remove it from the game. Without the idea of domination, there is nothing to eliminate, so this is the basic building block of the method.
Nash Equilibrium
Iterative elimination can help narrow a game to the strategies that may contain a Nash Equilibrium, but it is not the same thing as finding one. A Nash Equilibrium is a stable outcome where no player wants to change their choice alone. Elimination is a pruning method, while equilibrium is an outcome concept.
Best Response
Best response thinking is what makes elimination feel rational. When a strategy is dominated, it is never a best response to anything the other players might do. Comparing best responses across different opponent moves is often how you spot which rows or columns should be removed.
Perfect Information
In games with perfect information, players can see earlier moves, so backward reasoning and elimination-style thinking can become easier to apply. Even so, iterative elimination is not limited to those games. It is a general tool for simplifying strategic choice, whether or not every move is visible.
A problem set question may give you a payoff matrix and ask you to identify which strategies can be eliminated first, then continue until the reduced game is finished. The task is usually to compare payoffs across rows or columns, cross out dominated strategies, and explain why each elimination is valid. If the question asks for a final prediction, you use the reduced matrix to narrow the outcome set, then check whether the remaining strategies form a Nash Equilibrium or leave more than one possibility. In essay or discussion prompts, you may also be asked to explain why the order of elimination matters when weakly dominated strategies are involved.
A dominated strategy is the thing you remove, while iterative elimination is the process you use to keep removing them step by step. If a question asks whether one strategy is dominated, you are checking a single comparison. If it asks for iterative elimination, you keep repeating that comparison across the reduced game until nothing else can be cut.
Iterative elimination removes dominated strategies one round at a time, making a complicated game easier to analyze.
A strategy gets eliminated because it is always worse than another strategy for that player, not because it feels unlikely.
The order of elimination can matter when weak domination is involved, so the final reduced game is not always unique.
The method often narrows the path toward a Nash Equilibrium, but it does not guarantee a single equilibrium answer.
If you can read a payoff matrix and justify each cut, you are using iterative elimination the way Game Theory expects.
Iterative elimination is the repeated removal of dominated strategies from a game. You compare payoffs, cut the strategies that are never rational to choose, and then check the smaller game again for more eliminations.
Start by looking for a row or column that is always worse than another option for the same player. Remove that dominated strategy, then re-check the reduced matrix because a new strategy may now be dominated. Keep going until no more strategies can be eliminated.
No. Iterative elimination is a simplification method, while Nash Equilibrium is a stable outcome where no player wants to switch alone. Elimination can help narrow the search, but the reduced game can still have more than one possible result.
Sometimes, yes, especially with weakly dominated strategies. Because the order of elimination can affect which strategies remain, different valid elimination paths may leave different reduced games. That is why you should always justify each step carefully.