Dominant Strategy vs Nash Equilibrium
Dominant Strategy and Nash Equilibrium are two Market Structures concepts in AP Economics that students often mix up. A dominant strategy is a strategy that results in the highest payoff for a player regardless of the strategies chosen by other players. Nash Equilibrium is a stable state of a game where no player can improve their payoff by unilaterally changing their strategy. Here is how they compare side by side.
In game theory, a dominant strategy is the best course of action for a player in a game, no matter what the opponents do. If a player has a dominant strategy, they will always choose it. Not all games have a dominant strategy for each player.
In a Nash Equilibrium, each player's strategy is optimal given the strategies of the other players. No player can benefit by changing their strategy while the other players keep theirs unchanged. Nash Equilibria can occur in non-cooperative games with two or more players.
Dominant Strategy vs Nash Equilibrium: One Player's Move Against One Whole Outcome
| Dominant Strategy | Nash Equilibrium | |
|---|---|---|
| What the term labels | A single player's choice | A cell of the matrix, meaning a pair of choices |
| How you test for it | Hold the rival's choice fixed and compare that player's own payoffs | Check that neither player gains by switching alone away from that cell |
| How many a game can hold | At most one per player, and often neither player has one | None, one, or several, though exam matrices almost always have at least one |
| Direction of the link | If both players have one, the cell where they meet is a Nash equilibrium | Can exist with no dominant strategy anywhere in the game |
| What earns the point in writing | Name the option and show it beats the alternative against every rival move | Name both choices and both payoffs, since the answer is an outcome and not a move |
| Whether talking it over changes anything | No, the move stays best whatever the rival promises beforehand | Yes when a game holds two of them, since talking picks which one the players land on |
Two Nash equilibria can sit in a game where neither player has a dominant strategy
Two firms each choose a format, X or Y, and both lose if they choose differently. Payoffs run Firm A first. Both X pays 60 to A and 30 to B. Both Y pays 30 to A and 60 to B. Any mismatch pays zero to each. Firm A has no dominant strategy here, because X pays 60 against B choosing X but zero against B choosing Y, while Y pays 30 against B choosing Y and zero otherwise. A's best move depends entirely on B, and the same holds for B. The game still has two Nash equilibria, both X and both Y, since in each of those cells a lone switch drops that firm to zero. This is the case that breaks the link students assume. Dominance implies equilibrium, equilibrium does not imply dominance. A game can rest at a cell that neither firm could have picked without knowing the other's plan, which is why coordination problems call for communication, a shared standard, or a first mover, while a prisoner's dilemma is unmoved by all three.
The mistake that costs the point is comparing across players instead of within one
Checking dominance means comparing one player's payoffs to that same player's other payoffs, holding the rival's move fixed. Read Firm A's numbers by asking what A earns from each of its own options given that B has already chosen. Students who instead compare A's payoff to B's payoff inside a single cell are answering a different question, and the reasoning collapses on any asymmetric matrix. Two more habits protect the point. A dominant strategy has to win against every rival choice, so finding one case where it wins is not enough, and a strategy that merely ties in one case is weakly dominant at best. Second, a Nash equilibrium answer should name both choices and both payoffs, since the prompt asks for an outcome rather than a move. Marking each player's best response in the grid and then looking for the cell marked twice finds every pure strategy equilibrium in seconds.
Frequently asked questions
Can a game have a Nash equilibrium without any dominant strategy?
A Nash equilibrium can exist even when neither player holds a dominant strategy. Coordination games are the standard case. If both firms earn a positive payoff by matching formats and zero by mismatching, each firm's best move depends on the other's choice, so no strategy dominates. The game still has two stable cells, one for each matching pair, because a firm that switches alone drops to zero. Dominance implies equilibrium, but the reverse does not hold.
If both players have a dominant strategy, where is the Nash equilibrium?
The cell where the two dominant strategies meet is the Nash equilibrium. Each player is already choosing the move that pays best against anything the rival does, so no unilateral switch can improve a payoff. In a prisoner's dilemma paying 20 each at the both low cell and 50 each at the both high cell, the equilibrium is still both low, because dominance drives the firms away from the outcome they would jointly prefer.
How do you check for a dominant strategy on a payoff matrix?
Checking a dominant strategy means holding the rival's choice fixed and comparing one player's own payoffs. Take Firm A. Assume Firm B plays its first option and see which of A's choices pays more, then repeat under B's second option. If the same choice wins both times, A has a dominant strategy. Comparing A's payoff against B's payoff in the same cell settles nothing, because the two players are not competing over one shared number.
Related comparisons
Get AP Econ exam tips in your inbox
Occasional emails with study tips, new interactive graphs, and exam-season reminders. Free, no spam.
No spam. Unsubscribe anytime. Read our privacy policy.
Keep track of what you have studied
A free EconLearn account adds progress tracking, your quiz history, and achievements. Studying here is free either way, and there is nothing to pay for as a student.
Create a free accountAlready have one? Sign in
Last updated