Dominant strategy
A move that's your best response no matter what anyone else does.
What it means
In game theory, a strategy that yields a player at least as high a payoff as any alternative, regardless of the strategies chosen by opponents. When one exists, a rational player should simply play it without reasoning about others' choices, which makes prediction easy. The prisoner's dilemma is the famous case where defection is dominant for each player, so both defect even though mutual cooperation would be better — a stark illustration that individually optimal play can be collectively disastrous. It matters as the simplest, most compelling solution concept and the benchmark against which more subtle equilibria are judged.
Strict versus weak dominance
A strategy strictly dominates when it does strictly better against every possible opponent profile; it weakly dominates when it does at least as well everywhere and strictly better somewhere. The prisoner's dilemma has strict dominance; a second-price auction has only weak dominance, since your bid usually determines whether you win but not what you pay. The distinction is not pedantic. Iterated deletion of strictly dominated strategies yields the same surviving set no matter the order of removal, but deleting weakly dominated ones is order-dependent and can quietly erase legitimate equilibria. So the clean advice 'just play your dominant strategy and ignore everyone else' holds most firmly under strict dominance, and needs more care under weak.
Engineering a dominant strategy
The concept earns its keep because a designer can build a game in which honesty is dominant. Vickrey (1961) showed that a sealed-bid auction charging the winner the second-highest bid makes truthful bidding weakly dominant: your bid sets whether you win, never what you pay, so shading it can only cost you. Generalized, this is the Vickrey-Clarke-Groves mechanism, and the property is called strategy-proofness or dominant-strategy incentive compatibility. It is prized because participants need no beliefs about rivals to act well: the mechanism absorbs the strategic reasoning. Kidney exchange and some school-assignment systems are built around it, precisely so that a confused or ill-informed participant is not punished for telling the truth.
Why they are rare
Most interesting games hand no one a dominant strategy; the right move genuinely depends on what others do, which is why Nash equilibrium, not dominance, is game theory's workhorse. The Gibbard-Satterthwaite theorem sharpens the scarcity: for a vote over three or more options with unrestricted preferences, the only strategy-proof rule is a dictatorship, one voter deciding for all. Strategy-proof mechanisms therefore survive only in restricted domains where preferences have extra structure, such as auctions with transferable money or matching markets like deferred acceptance and top-trading-cycles. Where dominance cannot be engineered, designers fall back on weaker guarantees, accepting that participants must form beliefs and that some will try to game the rules.
When people fail to play it
Having a dominant strategy does not mean people use it. In second-price auction experiments, overbidding is stubborn: Kagel, Harstad and Levin (1987) and many replications find bids above value in a large share of rounds, even though truthful bidding is dominant and subjects understand the rules. Strikingly, the strategically equivalent English ascending auction produces far more truthful play. Li (2017) explains the gap with 'obvious dominance': a strategy is obviously dominant only if its worst possible outcome beats the best outcome of any deviation at the moment the two first diverge. The transparent, unfolding English auction clears that bar; the sealed-bid Vickrey, which asks bidders to reason about a hypothetical price, does not.
Examples
In the prisoner's dilemma, confessing pays more whether the other confesses or stays silent, so confessing is the dominant strategy.
In a sealed-bid auction where the winner pays the second-highest bid, naming your true value is dominant: bidding higher only wins overpriced lots, bidding lower only loses good ones.
Two rival cafes on the same street both open on Sundays. Opening beats closing whichever the other does, so neither gets the quiet Sunday they would both prefer.
Under a strategy-proof school-matching system like deferred acceptance, listing schools in true order of preference is dominant, so families gain nothing by trying to game the ranking.
If a performance drug improves results whether or not rivals also take it, doping is dominant for each athlete, and a clean field unravels into a doped one nobody wanted.
First described in Game theory; von Neumann & Morgenstern (1944).
Key references
- Li, S. (2017). Obviously Strategy-Proof Mechanisms. American Economic Review, 107(11), 3257–3287. doi.org/10.1257/aer.20160425
- Kagel, J. H., Harstad, R. M., & Levin, D. (1987). Information Impact and Allocation Rules in Auctions with Affiliated Private Values: A Laboratory Study. Econometrica, 55(6), 1275–1304. doi.org/10.2307/1913356
- Satterthwaite, M. A. (1975). Strategy-proofness and Arrow's Conditions. Journal of Economic Theory, 10(2), 187–217. doi.org/10.1016/0022-0531(75)90050-2
- Gibbard, A. (1973). Manipulation of Voting Schemes: A General Result. Econometrica, 41(4), 587–601. doi.org/10.2307/1914083
- Vickrey, W. (1961). Counterspeculation, Auctions, and Competitive Sealed Tenders. The Journal of Finance, 16(1), 8–37. doi.org/10.1111/j.1540-6261.1961.tb02789.x