📌 "In game theory, Nash Equilibrium is where no player wants to change their move, while Dominant Strategy is the best move no matter what others do." This article breaks down these two fundamental concepts with straightforward examples.
Game theory helps us understand how people make decisions when their choices affect each other. Two of its most important ideas are Nash Equilibrium and Dominant Strategy. While they sound similar, they describe different situations. A dominant strategy is the single best choice for a player. A Nash Equilibrium is a stable outcome where everyone is making their best response to what others are doing.
What is a Dominant Strategy?
A Dominant Strategy is a player's best move, regardless of what the other players decide to do. It "dominates" all other possible strategies because it always gives a better outcome.
Two suspects, Alex and Blake, are arrested. They can't communicate. The police offer each a deal:
- If both stay silent (Cooperate), each gets 1 year in prison.
- If one confesses (Defect) and the other stays silent, the confessor goes free (0 years) and the silent one gets 3 years.
- If both confess, each gets 2 years.
Two competing soda companies, ColaCo and PepCorp, are deciding on their advertising budget for the year. They have two choices: High or Low spend.
- If both choose Low spend, profits are stable.
- If one chooses High while the other chooses Low, the high-spender captures most of the market.
- If both choose High, they just cancel each other out and waste money.
For each company, spending High is the dominant strategy. If the rival spends Low, you win big by spending High. If the rival spends High, you must also spend High to avoid losing badly. High spend is always the safer, better choice.
What is a Nash Equilibrium?
A Nash Equilibrium (named after mathematician John Nash) is a set of strategies where no player can get a better result by unilaterally changing their own strategy, assuming the other players keep their strategies unchanged. Everyone is doing the best they can, given what everyone else is doing.
Consider the rule of which side of the road to drive on. In the US, the strategy is "Drive on the Right."
- If everyone else drives on the right, your best response is to also drive on the right. Switching to the left would cause a crash.
- No single driver has an incentive to switch sides alone. This is a Nash Equilibrium.
Store A and Store B sell the same TV. They can price it at $500 (High) or $400 (Low).
- If both price High ($500), they split the market and make good profit.
- If one prices Low ($400) and the other High, the low-price store gets all the customers.
- If both price Low ($400), they split the market but make very little profit.
The Nash Equilibrium here is (Low, Low). Why? If Store A is pricing at $400, Store B's best response is also $400 (to get some customers instead of none). If Store B is at $400, Store A's best response is $400. Neither can improve their outcome by changing price alone.
Key Differences: Side-by-Side Comparison
| Aspect | Dominant Strategy | Nash Equilibrium |
|---|---|---|
| Definition | A strategy that is best for a player no matter what others do. | A set of strategies where no player benefits by changing only their own move. |
| Focus | Single player's unconditional best choice. | Stability of the entire group's choices. |
| Existence | May or may not exist in a game. | Almost always exists (though there can be more than one). |
| Outcome | If all players have one, playing them leads to a Nash Equilibrium. | Can occur with or without dominant strategies. |
| Example | Confessing in the Prisoner's Dilemma. | Everyone driving on the same side of the road. |
⚠️ Common Pitfalls and Clarifications
- Not All Nash Equilibria are "Good": An equilibrium is simply stable, not necessarily optimal. The (Confess, Confess) outcome in the Prisoner's Dilemma is a bad Nash Equilibrium for both players.
- A Dominant Strategy Leads to Equilibrium: If every player in a game has a dominant strategy, and they all play it, that outcome will be a Nash Equilibrium. The reverse is not true.
- Multiple Equilibria: A game can have more than one Nash Equilibrium. The "Driving" game has two: (All Drive Right) and (All Drive Left). Both are equally stable.