Nash Equilibrium vs Prisoner's Dilemma
Nash Equilibrium and Prisoner's Dilemma are two Market Structures concepts in AP Economics that students often mix up. Nash Equilibrium is a stable state of a game where no player can improve their payoff by unilaterally changing their strategy. The prisoner's dilemma is a game theory scenario where two rational individuals acting in their own self-interest do not produce the optimal outcome for either. Here is how they compare side by side.
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.
In oligopoly, it explains why firms may fail to collude even when mutual cooperation would lead to higher joint profits, because each has an incentive to cheat on the agreement to gain a short-term advantage.
Nash Equilibrium vs Prisoner's Dilemma: A Solution Concept and One Particular Game
| Nash Equilibrium | Prisoner's Dilemma | |
|---|---|---|
| Category | A solution concept, a property that a cell either has or lacks | A payoff structure, one specific game |
| How many exist | A game can have none, one, or several in pure strategies | Exactly one, produced by dominant strategies |
| Efficiency | Can be efficient or inefficient, the concept is silent on it | Always worse for both players than mutual cooperation |
| Dominant strategies | Not required, equilibria exist in games with no dominant strategy | Required, defecting beats cooperating in every column |
| What a payoff change does | Nothing to the concept, you rerun the identical cell-by-cell test | One payoff change can end the dilemma while the equilibrium cell stays put |
| Typical question wording | Find the cell where neither player gains by switching alone | Explain why the rational outcome is not the best outcome |
Every prisoner's dilemma has a Nash equilibrium, but most Nash equilibria are not dilemmas
Take two firms deciding whether to advertise, with payoffs written as (Firm A, Firm B) in millions of profit. Neither advertises: (8, 8). Only A advertises: (10, 3). Only B advertises: (3, 10). Both advertise: (5, 5). Check Firm A's best response. If B does not advertise, A earns 10 by advertising against 8 by not, so A advertises. If B does advertise, A earns 5 by advertising against 3 by not, so A advertises again. Advertising is dominant for A, and by symmetry for B, so the unique Nash equilibrium is both advertise at (5, 5). That cell qualifies because neither firm gains by switching alone. It also leaves both firms worse off than the (8, 8) cell they cannot reach, and that second fact is what makes the game a prisoner's dilemma. The Nash concept did the first half of the work by identifying a stable cell. The payoff pattern did the second half, and only that pattern makes the outcome a dilemma rather than an ordinary equilibrium.
Change one payoff and the dilemma disappears while the equilibrium stays put
Raise the both-advertise payoff from (5, 5) to (9, 9) and rerun the check. If B does not advertise, A still earns 10 by advertising against 8. If B advertises, A earns 9 against 3. Advertising is still dominant for both, and the unique Nash equilibrium is still the both-advertise cell. Nothing about the solution concept changed. The dilemma is gone, though, because (9, 9) now beats the (8, 8) cooperative cell, so self-interest lands on the best joint outcome available. The reverse case is equally instructive. Two firms choosing a technical standard might face (6, 6) if both pick standard A, (4, 4) if both pick standard B, and (0, 0) if they mismatch. Neither firm has a dominant strategy, there are two Nash equilibria, and one of them is efficient. So a single game can carry several equilibria, no dominant strategy, and no dilemma at all, while still being solved with the identical rule you applied above.
The grader checks whether you tested each cell, not whether you recognized the pattern
Two errors cost points repeatedly. The first is naming the cell with the highest combined payoff as the Nash equilibrium. In the advertising game that would be (8, 8), which is not an equilibrium at all, since either firm can jump to 10 by advertising alone. The second is asserting a dominant strategy after checking only one of the opponent's moves. A dominant strategy has to win in every column, and a strategy that wins in one column while losing in the other is not dominant, even though the game may still have an equilibrium somewhere. The reliable procedure runs cell by cell, which in a two by two game means four cells and eight questions: at each cell, ask whether the row player gains by switching rows alone, then whether the column player gains by switching columns alone. A cell where both answers are no is a Nash equilibrium. Write that reasoning down rather than just circling a box, because the explanation is usually where the credit sits.
Frequently asked questions
Does every game have a Nash equilibrium in pure strategies?
Pure-strategy Nash equilibria can fail to exist. Matching pennies is the standard case: one player wins when the coins match and the other wins when they differ, so from any cell one player always wants to switch, and no cell survives the check. Games like that have an equilibrium only in mixed strategies, where each player randomizes. Most exam matrices are built so at least one pure-strategy equilibrium exists, so if your check rules out every cell, reread the payoffs before concluding there is none.
Is mutual defection in a prisoner's dilemma actually the equilibrium?
Mutual defection is the unique Nash equilibrium of a one-shot prisoner's dilemma, and it arrives through dominant strategies, which is a stronger property than equilibrium alone. Each player prefers defecting whatever the other does, so no belief about the opponent can rescue cooperation. The outcome is stable in the game-theory sense and bad in the welfare sense at the same time, and holding both of those facts together is the entire point of the example.
Why does repetition change the answer?
Repetition attaches a future payoff to today's choice. In a one-shot game, defecting costs nothing tomorrow, so the dominant strategy analysis holds. When the same players meet again with no known final round, cooperation can be sustained by the threat of losing future cooperation, and strategies such as tit for tat become workable. Exam questions usually specify a single interaction precisely to shut that door, so check the wording before you argue that cooperation survives.
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