Math paradoxes

Glossary / Dominant strategy

Glossary · dominant strategy

Best whatever happens, and still worse?

Usually, to decide anything in a competition, you have to guess what the rival will do. But sometimes one option is better than the others whatever the rival does. That is a dominant strategy: no guessing, no need to read the rival's mind. It seems you can't go wrong with one. Yet two players can each play their dominant strategy and both end up with less than if both had given it up.

In plain wordspictures, analogies, small numbers

“In plain words” is hidden on all puzzles.

Two coffee shops on one street

Every Monday each coffee shop decides: keep its price or offer a discount. The owners can't make a deal. Weekly profit, in thousands:

Both keep the price3 each
Both cut1 each
One cuts, the other doesn'tthe one that cut takes the customers: 5; the other is left with 0
A cut pays whatever happensif the neighbour keeps its price: 5 instead of 3; if it cuts: 1 instead of 0

Both owners are smart and both see that the cut is always better. If both pick the option that is better for them, what happens to each one's profit compared with a week when both kept the price?

Find the dominant strategy

The test is simple: forget your favourite option and compare column by column. Take the first column (the rival picked its first option) and see which of your rows gives you more. Then the second column. If the same row wins in both, it is dominant. For the rival it's the same, except you compare its numbers row by row. Try it in three games.

A dominant strategy is a luxury that turns up rarely. In "where to meet" the best choice depends entirely on the other person, and then agreements and habits matter. In the newcomer game something else is interesting: only the leader has a dominant strategy, but it's enough for the newcomer to know about it. If advertising always pays for the leader, the leader will advertise, and the newcomer responds to the advertising rather than to guesses. Someone else's dominant strategy is a clue too.

Rigoroustables, charts, formulas

“Rigorous” is hidden on all puzzles.

What a dominant strategy is

A dominant strategy is an option that gives a player more than any other option of theirs, whatever the other players choose. The opposite is a dominated strategy: there is another option that beats it whatever the others choose. A rational player never picks a dominated strategy, and always picks the dominant one if there is one.

  • Columns, not the biggest numberA common mistake is to pick the row with the biggest number in the table. Dominance is checked by comparing within each column separately: your option has to win in all of them.
  • Strict and weakA strictly dominant strategy is better everywhere. A weakly dominant one is never worse and better somewhere. An honest bid in a second-price auction is weakly dominant: it often gives the same as other bids, but never less.
  • Best for you ≠ best togetherDominance is about one player with the others held fixed. It promises nothing good about what happens when everyone plays their dominant strategy, as the price war shows.
  • Knowing it is enoughTo play a dominant strategy you need no assumptions about the rival and no faith in their rationality. That is why "the player will play the dominant strategy" is the most reliable prediction in game theory.

Cross out what can't win

Here each player has three options, and neither has a dominant strategy. But some options are dominated: another option beats them whatever the rival picks. A rational player won't pick them, and the rival, knowing that, can cross them out and look at a smaller table. In the smaller table new dominated options appear. Each cell shows your payoff first (rows), then the rival's (columns). The "5 · 5" cell is the best for both. Will rational players get there? Tap a row or a column you think can be crossed out.

    Each step here rests on the one before: the rival crosses out a column only if it believes you won't pick a row that is already crossed out, and you only if you believe the rival reasons the same way. The longer the chain, the more faith in the other's rationality it needs, and the less reliable the prediction when real people play.

    Where dominant strategies live

    • Price warsA discount that steals the rival's customers often pays whatever the rival does. That's why markets with a few similar players slide so easily into a price war in which all the sellers lose and the buyers win.
    • A lowest-price guarantee"Find it cheaper and we'll refund the difference" sounds like a gift to buyers, but it actually changes the table. If both coffee shops match each other's price, a cut no longer steals customers: it gives 1 instead of 3, and against the neighbour's cut the same 1. Keeping the price becomes a weakly dominant strategy.
    • Advertising racesIf advertising lures customers from rivals, advertising pays for each one alone, but together everyone pays and nobody lures anyone. Avinash Dixit and Barry Nalebuff, in "Thinking Strategically" (1991), describe the 1971 ban on cigarette ads on US television as a favour to the tobacco companies themselves: it stopped a race none of them could leave alone.
    • The second-price auctionThe highest bid wins, and the winner pays the second-highest. In 1961 William Vickrey showed that bidding exactly what the item is worth to you is weakly dominant here. Bidding higher sometimes makes you overpay; bidding lower sometimes loses you a profitable win. eBay's automatic bidding works almost the same way.
    Deepergeneralisations, theory, history

    “Deeper” is hidden on all puzzles.

    The formula and the link to equilibrium

    ui(si*, s−i) > ui(si, s−i)  for every other strategy si ≠ si* and every choice of the others s−i

    Here ui is player i's payoff and s−i the strategies of everyone else. Unlike a Nash equilibrium, where the inequality is checked only against the others' equilibrium strategies, here it must hold against all of them. So a dominant strategy is a far stronger condition. If every player has a strictly dominant strategy, the set of those strategies is the game's only Nash equilibrium. The converse is false: an equilibrium needs no dominant strategies. In the stag hunt (a stag caught together gives 4 each, a hare always 3, a stag alone 0) neither hunter has a dominant strategy, yet there are two equilibria.

    Two more properties of crossing out strictly dominated strategies. It never crosses out a Nash equilibrium. And the order doesn't matter: whatever sequence you cross them out in, the same set remains.

    Not beaten by any option, yet beaten by a mix

    Say you have three options and the rival has two: left and right. "Top" gives 3 against left and 0 against right, "Middle" 0 and 3, "Bottom" 1 and 1. "Bottom" is not dominated by any other option: against right it beats "Top", against left it beats "Middle". But toss a coin between "Top" and "Middle":

    ½ · 3 + ½ · 0 = 1,5 > 1   ·   ½ · 0 + ½ · 3 = 1,5 > 1

    On average the coin gives 1.5 against whatever the rival picks, while "Bottom" gives only 1. Any mix that picks "Top" with a probability between 1/3 and 2/3 works too. So "Bottom" is dominated by a mix, and a rational player won't pick it, though no single option beats it. That's why rigorous theory crosses out a strategy if any mix dominates it.

    Weak dominance: the order matters

    With weakly dominated strategies, crossing out behaves strangely. Take a game where you have three options and the rival has two, left and right. The pairs are your payoff and the rival's.

    Top: (1, 1) and (0, 0) · Middle: (1, 1) and (2, 1) · Bottom: (0, 0) and (2, 1)

    "Middle" weakly dominates both "Top" and "Bottom". Cross out "Top" first: then "right" is weakly better than "left" for the rival, and the game ends with payoffs (2, 1). Cross out "Bottom" first: now "left" is weakly better for the rival, and you get (1, 1). The same game, the same rules, and the answer depends on where you start. With strict dominance this never happens.

    Where the idea came from

    • Honesty as a strategyIn 1961, in a paper on auctions, William Vickrey first showed rules under which telling the truth is weakly dominant for every participant. In 1996 he received the Nobel memorial prize in economics for this and other work.
    • Voting without tricks is impossibleAllan Gibbard (1973) and Mark Satterthwaite (1975) proved that if there are at least three candidates and each can win, then any voting rule under which an honest vote is weakly dominant for every voter is a dictatorship: one voter decides the result. Under every other rule, someone sometimes gains by not voting for their favourite.
    • Dominance against the averageIn 1969 the philosopher Robert Nozick, in "Newcomb's Problem and Two Principles of Choice", described a problem where the rule "pick what dominates" and the calculation of the average payoff give different advice, and there is still no agreement on which is right.
    • From crossing out to rationalizabilityIn 1984 Douglas Bernheim and David Pearce, in the same issue of Econometrica, independently described which strategies a rational player who knows the others are rational too may choose. For two players these are exactly the ones left after crossing out all strictly dominated strategies, including those dominated by a mix.

    Where it shows up

    More on “Games and logic”

    All terms →