← The collection

Iterated Elimination of Dominated Strategies.

Remove only strategies that are strictly worse against every active opponent action.

Interactive experimentintuitiveField note ·
INTERACTIVE EXPERIMENT / P45

Iterated Elimination of Dominated Strategies

Remove only strategies that are strictly worse against every active opponent action.

PLAY & EXPLAIN

Each cell lists row-player payoff first, column-player payoff second. Strict dominance requires a better alternative against every currently possible opponent action.

Active payoff matrix
RowLMR
A3, 32, 14, 2
B1, 21, 02, 1
C2, 43, 25, 3

Remove a strictly dominated strategy, one at a time.

Strictly dominated strategies cannot be best responses in this finite game. Weak dominance has additional subtleties; this activity does not apply its removal rule to weak ties.

Only pure strict dominance is used. Weak dominance, mixed domination, uncertainty about payoffs and beliefs require additional analysis.

THE SHORT VERSION

Iterated Elimination of Dominated Strategies, explained.

Iterated strict dominance removes a strategy when another available strategy gives its player a higher payoff against every remaining opponent action.

01 / THE MECHANISM

Why it happens

A declared three-by-three payoff matrix is reduced through player-selected row and column removals. Invalid removals leave the strategy in place and explain the missing condition; the strict-dominance survivor is A,L.

Iterated strict dominance removes a strategy when another available strategy gives its player a higher payoff against every remaining opponent action.

Read the result

A removable strategy must lose strictly to some other active strategy at every active opponent action. A single favourable comparison is insufficient.

02 / FOLLOW IT THROUGH

A worked example

Reduce a payoff matrix using valid eliminations

  1. Remove row B after verifying that row A beats it at all three columns.

  2. Remove column M and column R when the column player’s strictly better remaining alternative is checked across active rows.

  3. With only L left, remove row C and inspect the surviving A,L profile.

OPTIONAL DEEPER DETAILGo deeper: inside the model

Inside this model

A declared three-by-three payoff matrix is reduced through player-selected row and column removals. Invalid removals leave the strategy in place and explain the missing condition; the strict-dominance survivor is A,L.

03 / BEYOND THE EXPERIMENT

Where this idea is useful

A practical use

Check every relevant opponent response before calling an option strategically inferior.

CHECK YOUR INTUITION

A common misconception

THE TEMPTING CONCLUSION

“A strategy is dominated if it loses in one cell.”

THE MORE USEFUL DISTINCTION

Strict dominance compares an alternative against every currently possible opponent response, so one bad outcome does not establish removal.

What this explanation leaves out

  • Only pure strict dominance is used. Weak dominance, mixed domination, uncertainty about payoffs and beliefs require additional analysis.
ONE MORE QUESTION

Would the same rule safely remove all weakly dominated strategies?

Weak dominance has additional order and interpretation subtleties. This activity deliberately uses only strict payoff inequalities.

TAKE THE IDEA WITH YOU

Have you checked the opponent response that makes your preferred elimination fail?

Associated thinkers

Associated withJohn Nash ↗

Associations marked provisional are awaiting source review.

Further reading

Explore the original research or the teaching reference behind this experiment.