Dominated Strategy¶

Rule out an action that yields a lower payoff than some alternative for every possible profile of opponents' actions — a belief-free test requiring no model of the opponent, licensing iterated elimination and the dominant-strategy robustness that mechanism design targets.

Version: v3 · 2026-09-28 · History
Domain-specific #: 291
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomains: Game Theory, Game Theoretic Solution Concepts → Mathematics

Core Idea¶

A dominated strategy is an action that yields a weakly or strictly lower payoff than some other available action for every possible combination of opponents' actions. Because it never performs better regardless of what opponents do, a rational player never plays it, and common knowledge of rationality extends the assumption to opponents — licensing iterated elimination, which can collapse a game to a single outcome (Defect strictly dominates in the Prisoner's Dilemma). It differs sharply from Nash equilibrium: dominance is a belief-free condition applicable without modeling opponents at all.

How would you explain it like I'm…

Cross-It-Off Choices

Sometimes in a game you have a choice that is never better than another choice you have, no matter what the other player does. So you can cross that choice off. And if everyone crosses off their silly choices, the game gets simpler.

Cross-It-Off Moves

A Dominated Strategy is a choice that is never better than some other choice you could make, whatever the other players do. A sensible player never needs to pick it, so you can cross it off. If everyone knows everyone is sensible, they can cross off each other's dominated choices too, and then new choices may become dominated, so you keep crossing off. In the Prisoner's Dilemma, cooperating is dominated by betraying for each player, which leaves only 'both betray'. This is different from finding a balance point where everyone reacts to what others actually do, because crossing off does not require guessing what others will choose.

Always-Outdone Strategy

In game theory, a Dominated Strategy is an action that does worse, or at best no better, than some other available action against every possible combination of opponents' choices. A rational player has no reason to play it, and if rationality is common knowledge, each player can assume others will not play theirs either. Removing these strategies can make new strategies dominated, so the process repeats, which is called iterated elimination; sometimes it leaves a single outcome. In the Prisoner's Dilemma, Defect strictly dominates Cooperate. In a second-price sealed-bid auction, bidding your true value weakly dominates other bids, which is the basis of truthful mechanism design. This differs from Nash equilibrium, which requires best responses to what others actually play; every Nash equilibrium survives elimination of strictly dominated strategies, but not every survivor is an equilibrium.

A Dominated Strategy is an action in a strategic-form game whose payoff is weakly or strictly lower than that of some other action for every profile of opponents' actions. Since it never outperforms its dominator, rational players avoid it, and common knowledge of rationality lets each player assume opponents avoid theirs. This licenses iterated elimination: removing dominated strategies can create new dominance relations in the reduced game, and repetition can collapse the game to a single outcome without equilibrium computation. In the Prisoner's Dilemma one round eliminates Cooperate, leaving (Defect, Defect). In the Vickrey second-price auction, truthful bidding weakly dominates all other bids, since underbidding risks losing a profitable win and overbidding risks winning above value, with no compensating gain. That result grounds dominant-strategy incentive compatibility, which makes truth-telling optimal without assumptions about others. Unlike Nash equilibrium, a fixed-point condition on strategies and beliefs, dominance needs no model of opponents; every Nash equilibrium survives iterated elimination of strictly dominated strategies, but not conversely, so dominance analysis is the natural first step.

Scope of Application¶

The construct applies wherever its precondition holds — decision-making agents, explicit strategy sets, and payoffs depending on the joint action profile.

Game-theory solution analysis — the belief-free pre-equilibrium reduction run before any Nash search.
Auction theory — certifying truthful bidding weakly dominates in the Vickrey second-price auction.
Mechanism design — the gold-standard target, dominant-strategy incentive compatibility (DSIC).
Voting theory — the object of the Gibbard-Satterthwaite theorem.
Bargaining and contracting — the standard pre-equilibrium clearing of strategies no rational party would choose.
Single-agent decision theory — the thinner statewise form (carried by general decision-theoretic dominance reasoning, not a catalog prime).

Clarity¶

Naming dominated strategy isolates the one analytical move that requires no model of the opponent at all, dissolving the belief that every strategic judgment rests on a guess about the other player. An action worse than an alternative no matter what opponents do is discarded before any probability, type space, or fixed point is invoked. It sharpens strict versus weak dominance (governing whether elimination is safe to iterate) and the gap between optimal given correct beliefs and optimal regardless of beliefs — the whole point of DSIC.

Manages Complexity¶

Solving a game in full is combinatorially heavy — a fixed-point over all players' interdependent beliefs. Dominance supplies a belief-free reduction that runs first: each action gets the local question "worse than some alternative no matter what?", and iterated elimination monotonically shrinks the game, sometimes to one outcome. In mechanism design it collapses an intractable robustness question to a checkable one: DSIC compresses the entire belief space to nothing, so the designer verifies incentive compatibility one participant at a time against no model of the rest.

Abstract Reasoning¶

The construct licenses diagnostic testing of each action for dominance without modeling opponents (graded strict or weak, with common knowledge of rationality extending deletion to opponents), interventionist iterated elimination and the design-side goal of engineering a wanted action to dominate (DSIC, Vickrey), boundary-drawing that separates dominance from the Nash best-response fixed-point and optimal-given-beliefs from optimal-regardless, and prediction that a dominated action is never played and a dominant-strategy mechanism is robust where an equilibrium one fails.

Knowledge Transfer¶

Dominated strategy is an analytical construct, so it transfers literally wherever its precondition holds — agents, strategy sets, joint-profile payoffs — carrying unchanged into auction theory, mechanism design, voting theory, and bargaining as the same test. Its home is wide but one Kind (Type Theory) of substrate, which is why it is domain-specific, not a prime. Absent a strategy space (a thermostat, a clearing market) it does not weaken into analogy — it simply does not apply. The thinner "discard the under-every-contingency-worse option" kernel travels as general decision-theoretic dominance reasoning, not as a catalog prime; the opponents, common-knowledge, and DSIC machinery stay home.

Relationships to Other Abstractions¶

Current abstraction Dominated Strategy Domain-specific

Parents (1) — outgoing typed relations

Dominated Strategy is a kind of Game-Theoretic Strategy Prime

A dominated strategy is a game-theoretic strategy for which another available strategy performs at least as well against every opponent profile.

Children (2) — abstractions linked here by typed relations

Global Games Domain-specific includes Dominated Strategy

Global Games contains iterated deletion of dominated strategies as the engine that moves inward from extreme-signal dominance regions.
Traveler's Dilemma Domain-specific includes Dominated Strategy

Traveler's Dilemma contains a 98-step chain of weakly dominated claims whose iterative elimination produces its behaviorally fragile endpoint.

Hierarchy path (1) — routes to 1 parentless root

Dominated Strategy → is a kind of Game-Theoretic Strategy → is a decomposition of Function (Mapping)

Neighborhood in Abstraction Space¶

Dominated Strategy sits in a crowded region of the domain-specific corpus (19^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Strategic Games & Equilibrium Concepts (14 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-25