Nash Equilibrium in Game Theory: Explanation, Examples, and Prisoner’s Dilemma
Nash equilibrium is a cornerstone of game theory, offering a framework to analyze how rational players make strategic decisions in competitive or cooperative scenarios. Named after mathematician John Nash (whose life inspired the film A Beautiful Mind), this concept explains how interactions between players reach a stable state where no individual has an incentive to change their strategy—assuming others stick to theirs. In this blog, we’ll explore the definition, mechanics, real-world examples, and the famous Prisoner’s Dilemma to illustrate Nash equilibrium in action.
Table of Contents#
- What Is Nash Equilibrium?
- How Does Nash Equilibrium Work?
- Key Characteristics of Nash Equilibrium
- Examples of Nash Equilibrium
- Nash Equilibrium in the Prisoner’s Dilemma
- Real-World Applications of Nash Equilibrium
- Criticisms and Limitations
- Conclusion
- References
1. What Is Nash Equilibrium?#
Nash equilibrium is a state in game theory where:
- Every player has chosen a strategy (a plan of action).
- No player can benefit by changing their strategy if all other players keep their strategies unchanged.
In other words, each player’s strategy is the best response to the strategies chosen by all other players. For example, if two companies (Player A and Player B) compete on pricing, and both set a “high price” strategy, neither can increase profits by switching to “low price” (because the other would match the low price, eroding profits). Thus, (High Price, High Price) is a Nash equilibrium.
John Nash formalized this concept in 1950, proving that every finite game with a finite number of players has at least one Nash equilibrium (in mixed or pure strategies). This theorem revolutionized game theory, providing a universal tool to analyze strategic interactions.
2. How Does Nash Equilibrium Work?#
To understand Nash equilibrium, consider a simple two-player game with strategies and payoffs (rewards/penalties for each outcome). Let’s use a “Pricing Game” with two firms (Firm 1 and Firm 2) choosing between “High Price” (H) or “Low Price” (L):
| Firm 2: High Price (H) | Firm 2: Low Price (L) | |
|---|---|---|
| Firm 1: H | (Profit: 5M) | (Profit: 8M) |
| Firm 1: L | (Profit: 1M) | (Profit: 3M) |
Step 1: Analyze Firm 1’s Incentives#
- If Firm 2 chooses H:
- Firm 1 gets 8M (L). So Firm 1 prefers L (higher profit).
- If Firm 2 chooses L:
- Firm 1 gets 3M (L). So Firm 1 prefers L (higher profit).
Step 2: Analyze Firm 2’s Incentives#
- If Firm 1 chooses H:
- Firm 2 gets 8M (L). So Firm 2 prefers L.
- If Firm 1 chooses L:
- Firm 2 gets 3M (L). So Firm 2 prefers L.
Step 3: Identify Equilibrium#
Firm 1 will always choose L (regardless of Firm 2’s choice), and Firm 2 will also always choose L. Thus, (L, L) is the Nash equilibrium—neither firm can increase profits by switching to H (since the other firm would still choose L, leading to lower profits).
3. Key Characteristics of Nash Equilibrium#
- Stability: No player has an incentive to deviate unilaterally. The outcome is “self-enforcing.”
- Multiple Equilibria: A game can have one, multiple, or no pure-strategy Nash equilibria (some games only have mixed-strategy equilibria, where players randomize strategies).
- Rationality Assumption: Assumes players are rational (they maximize their payoffs) and have complete information (know all players’ strategies and payoffs).
- Applicability: Works for simultaneous games (players act at the same time) and sequential games (players act in turns, like chess), though sequential games often use “subgame perfect Nash equilibrium” (a refined version).
4. Examples of Nash Equilibrium#
Example 1: Coordination Game (Meeting Friends)#
Two friends (Alice and Bob) agree to meet at either a Café (C) or a Park (P). Their payoffs:
- If both go to Café: (5,5) (high satisfaction).
- If both go to Park: (3,3) (moderate satisfaction).
- If they go to different places: (1,1) (low satisfaction).
| Bob: Café (C) | Bob: Park (P) | |
|---|---|---|
| Alice: C | (5,5) | (1,1) |
| Alice: P | (1,1) | (3,3) |
- If Alice chooses C, Bob’s best response is C (5 > 1).
- If Alice chooses P, Bob’s best response is P (3 > 1).
- Similarly, Alice’s best response matches Bob’s choice.
Thus, there are two Nash equilibria: (C, C) and (P, P).
Example 2: “Chicken” Game (High-Stakes Dilemma)#
Two drivers (Driver 1 and Driver 2) race toward each other. Each can “Swerve” (avoid crash) or “Straight” (risk crash). Payoffs:
- Both Swerve: (2,2) (safe, but “chicken”).
- One Swerves, One Goes Straight: (0,5) (Swerver loses face; Straight driver wins).
- Both Go Straight: (-10, -10) (crash, severe loss).
| Driver 2: Swerve | Driver 2: Straight | |
|---|---|---|
| Driver 1: S | (2,2) | (0,5) |
| Driver 1: St | (5,0) | (-10, -10) |
- If Driver 2 Swerves, Driver 1 prefers Straight (5 > 2).
- If Driver 2 Goes Straight, Driver 1 prefers Swerve (0 > -10).
- Symmetrically for Driver 2.
Thus, there are two pure-strategy Nash equilibria: (S, St) and (St, S).
5. Nash Equilibrium in the Prisoner’s Dilemma#
The Prisoner’s Dilemma is a classic game illustrating conflict between individual and collective rationality.
Setup:#
Two suspects (X and Y) are arrested for a crime. Police offer a deal:
- If both remain silent (Cooperate, C): Both get 1 year in prison.
- If one confesses (Defect, D) and the other stays silent: Defector goes free; Silent prisoner gets 5 years.
- If both confess (Defect): Both get 3 years.
| Prisoner Y: Cooperate (C) | Prisoner Y: Defect (D) | |
|---|---|---|
| X: C | (1 year, 1 year) | (5 years, 0 years) |
| X: D | (0 years, 5 years) | (3 years, 3 years) |
Analyzing Equilibrium:#
- If Y Cooperates: X prefers Defect (0 years > 1 year).
- If Y Defects: X prefers Defect (3 years > 5 years).
- Same for Y: Defect is always better.
Thus, the Nash equilibrium is (D, D) (both confess, 3 years each), even though (C, C) (1 year each) is better for both. This shows how individual self-interest can lead to a collectively worse outcome—an example of a “tragedy of the commons” in game theory.
6. Real-World Applications of Nash Equilibrium#
- Economics (Oligopolies): Firms in an oligopoly (e.g., smartphone makers) use Nash equilibrium to predict competitors’ pricing/innovation strategies. For example, if Apple lowers iPhone prices, Samsung may follow (to avoid losing market share), leading to a Nash equilibrium in pricing.
- International Relations: Countries deciding on nuclear disarmament. If one country disarms, the other may defect (keep weapons for security), leading to a Nash equilibrium of mutual armament (even if disarmament is better collectively).
- Biology (Evolutionary Game Theory): Animals competing for resources (e.g., territory). A “fight” or “flee” strategy can reach Nash equilibrium (e.g., weaker animals flee, stronger fight—neither benefits from switching).
- Business Negotiations: In a labor strike, unions and management negotiate wages. If unions strike (defect), management may concede; if management holds firm (defect), unions may back down. The equilibrium depends on payoffs (e.g., cost of strike vs. cost of wage increases).
7. Criticisms and Limitations#
- Rationality and Information: Assumes players are perfectly rational and have complete information (unrealistic in real life—people often act irrationally, and information is incomplete).
- Multiple Equilibria: When a game has multiple equilibria, Nash equilibrium doesn’t tell us which one will occur (e.g., the coordination game: will friends meet at Café or Park?).
- Mixed Strategies: Some games only have mixed-strategy equilibria (players randomize choices), which can be unintuitive (e.g., in “Matching Pennies,” the equilibrium is to randomize heads/tails).
- Repeated Games: In repeated interactions (e.g., ongoing business competition), players can use strategies like “tit-for-tat” (cooperate if opponent cooperated, defect otherwise), which changes the equilibrium (Nash equilibrium in repeated games differs from one-shot games).
8. Conclusion#
Nash equilibrium is a powerful tool to analyze strategic decision-making, revealing how individual choices create stable (or unstable) outcomes. From the Prisoner’s Dilemma to global politics, it explains why players often stick to strategies that, while suboptimal for the group, are optimal for themselves. While it has limitations (e.g., rationality assumptions), its applications across economics, biology, and social sciences make it indispensable for understanding human and animal behavior.
9. References#
- Nash, J. F. (1950). Equilibrium points in n-person games. Proceedings of the National Academy of Sciences, 36(1), 48-49.
- Osborne, M. J., & Rubinstein, A. (1994). A Course in Game Theory. MIT Press.
- Investopedia. (2023). Nash Equilibrium. Retrieved from https://www.investopedia.com/terms/n/nash-equilibrium.asp
- Nobel Prize. (2023). John Nash - Biographical. Retrieved from https://www.nobelprize.org/prizes/economics-sciences/1994/nash/biographical/