Glossary / Dominant strategy
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 words” is hidden on all puzzles.
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 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?
Each one's profit falls threefold: 1 instead of 3.
Both lines of reasoning are right at once. "Whatever my neighbour does, I'm better off cutting" is true: 5 beats 3 and 1 beats 0. "If we both cut, we're both worse off" is true too: 1 is less than 3. The cut is best for each one alone, and the same cut made by both is worse for each. A dominant strategy compares your options while the rival's choice stays fixed. But the rival doesn't stay fixed: it has the same table and the same temptation.
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.
“Rigorous” is hidden on all puzzles.
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.
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.
“Deeper” is hidden on all puzzles.
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.
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.
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.
A set of strategies where nobody gains by changing their own while the others keep theirs.
In the prisoner's dilemma both betray, though both would be better off silent: an equilibrium is not the best outcome.
Solving a game from the end: the last move first, then the one before it, back to the first.
In the centipede game logic says grab the pennies on the very first move, though playing on would give both of them hundreds, and real people almost never do it.
Everyone knows a fact, everyone knows that everyone knows, and so on without end.
Two generals can swap a thousand confirmations and still lack common knowledge, so neither dares to attack first.