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.

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.

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 dominance).

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 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 via decision-theoretic dominance; the opponents, common-knowledge, and DSIC machinery stay home.

Relationships to Other Abstractions¶

Current abstraction Dominated Strategy Domain-specific

Parents (1) — more general patterns this builds on

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) — more specific cases that build on this

Global Games Domain-specific is part of 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 is part of 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 → Game-Theoretic Strategy → Function (Mapping)

Neighborhood in Abstraction Space¶

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

Family — Strategic Interaction & Game Theory (23 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-07-12