Key takeaways
– A Nash equilibrium is a profile of strategies (one for each player) in which no single player can improve their payoff by unilaterally changing their strategy, given the other players’ strategies. (Investopedia; Nash)
– A game can have one, several, or no pure-strategy Nash equilibria; if none exist in pure strategies, an equilibrium may still exist in mixed strategies.
– Nash equilibrium differs from a dominant strategy: a dominant strategy is best no matter what others do, while a Nash equilibrium requires best responses given others’ choices.
– The concept underpins analysis across economics, business, political science and other fields, but it relies on assumptions (rationality, common knowledge) and has limits as a predictive tool.
Source: adapted and summarized from Investopedia’s “Nash Equilibrium” and foundational work by John Nash (1950/1951).
Understanding Nash equilibrium
At its core, a Nash equilibrium is a stable state of a strategic interaction: once players pick the equilibrium strategies, no one has an incentive to change their own strategy alone. Each player’s strategy is a best response to the strategies chosen by everyone else.
Why it matters
– Predictive framework: It identifies outcomes that are self-enforcing given players’ incentives.
– Comparative statics: It helps evaluate how changes in payoffs, information, or rules shift behavior.
– Wide applicability: Used for pricing and entry decisions in firms, auctions, voting, public goods, regulatory design, and many more settings.
Nash equilibrium vs. dominant strategy
– Dominant strategy: A strategy that yields a better outcome for a player regardless of what opponents do. If every player has a dominant strategy, the profile of those strategies is a Nash equilibrium.
– Nash equilibrium: Each player’s strategy is a best response to the others’ strategies. A Nash equilibrium does not require dominance—players’ best choices may depend on opponents’ choices.
Important (assumptions and limitations)
– Rationality: Players are assumed to maximize expected payoff.
– Common knowledge: Players know the game and know that others are rational, and so on.
– Static vs dynamic: Nash equilibrium is defined for static (one-shot) games but is generalized to dynamic games via subgame-perfect equilibrium.
– Multiplicity and selection: Games can have multiple equilibria; extra criteria (refinements, focal points) are needed to select among them.
– Real-world frictions: Bounded rationality, incomplete information, coordination problems, and enforcement issues can make Nash predictions less reliable.
What is a Nash equilibrium in simple words?
A Nash equilibrium is a set of choices where each person is doing the best they can given what everyone else is doing—so no one would want to change their own choice unless someone else changes first.
Example of Nash equilibrium (simple two-action example)
Imagine two players, Tom and Sam. Each chooses A (get $1) or B (lose $1).
– If both pick A, both get $1.
– If either picks B (while the other picks A), that player loses $1.
If both pick A, neither can increase their payoff by switching to B (switching would reduce their payoff). So (A, A) is a Nash equilibrium.
Prisoner’s dilemma (classic illustration)
Scenario:
– Two suspects detained separately. Each can Cooperate (remain silent) or Defect (betray the other).
– Typical payoffs expressed as years in prison (lower is better): If both cooperate each gets 1 year; if both defect each gets 5 years; if one defects while the other cooperates, the defector goes free and the cooperator gets 10 years.
Why mutual defection is a Nash equilibrium:
– If prisoner A expects B to cooperate, A’s best response is to defect (go free rather than get 1 year).
– If A expects B to defect, A’s best response is to defect (5 years instead of 10).
– So defecting is a best response to either action by the other—both will defect. Even though mutual cooperation would give both lower sentences overall, unilateral deviation from cooperation is attractive, producing the equilibrium of mutual defection.
How do you identify a Nash equilibrium? (practical steps)
1. Specify the game
• List players, their available strategies, and payoffs for each combination of strategies.
2. Represent the game
• For two players, construct a payoff matrix; for sequential games, draw a game tree.
3. Find best responses
• For each possible strategy of the opponent(s), determine the strategy or strategies that maximize a player’s payoff (their best response(s)).
4. Identify mutual best responses
• A strategy profile is a Nash equilibrium when every player’s chosen strategy is a best response to the others’ chosen strategies.
• Look for cells in a payoff matrix where both players’ payoffs are best responses simultaneously.
5. Consider mixed strategies
• If no pure-strategy equilibrium exists, calculate mixed-strategy equilibria: find probability distributions over actions so that each player is indifferent among the actions they use with positive probability.
6. Check refinements for dynamic games
• In sequential games, use subgame-perfect equilibrium (backward induction) to eliminate incredible threats.
7. Test robustness
• Evaluate whether small changes in payoffs or the information structure would alter the equilibrium; consider equilibrium refinements (trembling-hand perfect, etc.) if needed.
Practical worked example (two-firm pricing)
– Two firms choose High or Low price. Payoffs:
• Both High: each gets 10
• One High, other Low: Low-price firm gets 15, High firm gets 5
• Both Low: each gets 7
– For each firm, compare payoffs given the other firm’s choice:
• If rival chooses High: best response is Low (15 > 10).
• If rival chooses Low: best response is Low (7 > 5).
– Low is a dominant strategy for each firm; (Low, Low) is the Nash equilibrium (and also the dominant-strategy equilibrium).
Why Nash equilibrium is important (practical uses)
– Business: Predict competitors’ pricing, product launches, capacity choices, or advertising investments.
– Policy: Anticipate strategic responses to regulations, tax changes, or sanctions.
– Negotiation: Identify stable agreements and possible incentives to deviate.
– Mechanism design: Build rules (auctions, markets) so that the equilibrium outcome is desirable.
Practical steps to apply Nash reasoning in real life or business decisions
1. Model the decision environment: identify actors, feasible actions, and likely payoffs.
2. Consider information: what do players know about each other’s payoffs and moves?
3. Compute best responses and potential equilibria using the practical steps above.
4. Stress-test equilibria: ask how results change with slight payoff, timing, or information shifts.
5. Identify commitment devices: change rules, contracts, or timing to eliminate bad equilibria and support good ones.
6. Use experiments or historical data to validate which equilibrium is likely in practice.
7. Design incentives or institutions that make desirable equilibria stable (e.g., contracts, reputation systems, penalties).
Limitations and caveats
– Multiple equilibria complicate predictions and may require extra selection criteria (focal points, risk-dominance, historical precedent).
– Assumes rationality and common knowledge—real agents may be boundedly rational or have private information.
– Nash equilibrium describes static stability, not necessarily how players learn or converge to that equilibrium over time.
– Welfare considerations: Nash equilibria need not be socially optimal (as the prisoner’s dilemma shows).
The bottom line
Nash equilibrium formalizes the idea of mutual best responses in strategic settings: once reached, no single player can unilaterally improve their outcome. It is a central analytical tool for studying strategic interactions in economics, business, and public policy, but using it well requires careful modeling, attention to assumptions, and testing for robustness and multiplicity.
References and further reading
– Investopedia, “Nash Equilibrium,”
– Nash, J. (1950). “Equilibrium points in n-person games.” Proceedings of the National Academy of Sciences.
– Nash, J. (1951). “Non-Cooperative Games.” Annals of Mathematics.
– Walk through a payoff matrix for a specific business example you give;
– Compute a mixed-strategy Nash equilibrium for a game you supply; or
– Show how to use best-response diagrams to find equilibria. Which would be most useful?