Game theory
Dominant Strategy
Why "confess" beats staying silent no matter what your partner does.
A dominant strategy is a choice that yields a player a payoff at least as good as every alternative regardless of what opponents do, and a strictly dominant strategy yields a strictly better payoff against every opponent action.
TL;DR
- A dominant strategy is one that gives a player at least as high a payoff as any other strategy, whatever the opponents choose.
- Strict dominance means the strategy is strictly better against every opponent action, while weak dominance means it is never worse and sometimes better.
- If every player has a dominant strategy, the combination is a dominant-strategy equilibrium, which is always a Nash equilibrium.
- In the Prisoner's Dilemma, defecting (confessing) strictly dominates cooperating, so rational players defect even though mutual cooperation pays both more.
- A dominant strategy is powerful because it is optimal without any assumption about what the other players will do.
When to use it
- Use dominant-strategy reasoning when you must act without knowing or trusting others' choices, because a dominant move stays optimal against every possibility.
- Use it to simplify a game: iteratively eliminating dominated strategies shrinks the analysis and often reveals a single predictable outcome.
- Use it in mechanism design, such as second-price (Vickrey) auctions, where making truth-telling a dominant strategy removes any incentive to game the system.
When it fails
- It fails when no strategy dominates: in most games the best move depends on what opponents do, so you need Nash equilibrium or mixed strategies instead.
- It fails in repeated interaction, where the shadow of future retaliation (tit-for-tat) can make cooperation rational even though defection dominates each one-shot round.
- It assumes players are rational payoff-maximisers with correctly specified payoffs; if real preferences include fairness, reputation, or spite, the 'dominant' move may not be chosen.
Worked example
Two partners in crime are arrested and interrogated in separate rooms. Each can stay silent or confess. If both stay silent, weak evidence gives each a light one-year sentence; if both confess, each gets two years; if only one confesses, the confessor walks free while the silent partner serves three years. Neither can communicate or coordinate before deciding.
Look at the decision from one prisoner's side. If your partner stays silent, confessing gets you zero years instead of one, so confessing wins. If your partner confesses, confessing gets you two years instead of three, so confessing wins again. Confessing beats silence in every case, which makes it a strictly dominant strategy: the choice you should make no matter what the other person does.
Because the game is symmetric, the same logic drives the other prisoner to confess. Both follow their dominant strategy, and the result, two years each, is a dominant-strategy equilibrium, which is automatically a Nash equilibrium. Yet both would have served only one year had they stayed silent, so individually rational dominance produces a jointly worse outcome than the cooperative alternative.
| Prisoner B | ||
|---|---|---|
| Prisoner A | Stay silent | Confess |
| Stay silent | −1 / −1 | −3 / 0 |
| Confess | 0 / −3 | −2 / −2 |
Related concepts
- Prisoner's Dilemma — The canonical game where each player's dominant strategy (defect) leads to a worse outcome for both.
- Nash Equilibrium — A dominant-strategy equilibrium is always a Nash equilibrium, but not every Nash equilibrium uses dominant strategies.
- Tit for Tat — In repeated play, tit-for-tat can beat the one-shot dominant strategy of always defecting.
- Tragedy of the Commons — A many-player case where over-using a shared resource is each individual's dominant strategy.
FAQ
What is a dominant strategy in simple terms?
A dominant strategy is your best move no matter what anyone else does. Because it beats every alternative against every possible opponent choice, you never need to guess their plan; you just play it. If a move is only best some of the time, it is not dominant.
What is an example of a dominant strategy?
In the Prisoner's Dilemma, confessing is the dominant strategy for each suspect. Whether your partner stays silent or confesses, confessing gives you a lighter sentence in both cases. So both rationally confess, even though staying silent together would have left both of them better off.
Dominant strategy vs Nash equilibrium — what's the difference?
A dominant strategy is best regardless of others' choices, while a Nash equilibrium is a stable combination where no one gains by deviating given what others actually do. Every dominant-strategy equilibrium is a Nash equilibrium, but most Nash equilibria involve strategies that are only best responses, not dominant ones.
Why does a dominant strategy lead to a worse outcome for everyone?
Because each player optimises individually, ignoring the cost their choice imposes on the other. Confessing is individually dominant, so both confess and land at mutual punishment. The cooperative outcome is better for both but unstable: each has a private incentive to defect, so self-interest overrides the joint gain.
How do you find a dominant strategy in a payoff matrix?
Compare a player's payoffs against each opponent action, column by column. If one strategy gives a higher payoff in every column, it strictly dominates; if it is never worse and sometimes better, it weakly dominates. Repeat for each player, and if all have one you get a dominant-strategy equilibrium.