๐Ÿ”’ Full Lesson ยท Market Structures
No Player Can Improve by Changing Strategy ALONE
Nash Equilibrium

The formal concept that identifies the stable, predictable outcome of a strategic game โ€” the specific combination of choices where every single player, individually, would be making things worse for themselves by switching.

The Core Idea
The Stable Resting Point of a Strategic Game

A Nash Equilibrium is a specific combination of strategies โ€” one for each player in a game โ€” where NO single player can improve their own outcome by unilaterally changing their own strategy, GIVEN what every other player is currently doing. This is the direct answer to the question Game Theory raises: out of all the possible combinations of choices, which one is actually STABLE โ€” a resting point nobody has an individual incentive to move away from?

Critically, a Nash Equilibrium doesn't require the outcome to be the BEST possible outcome for everyone collectively (the Prisoner's Dilemma's 'both betray' outcome IS a Nash Equilibrium, even though 'both stay silent' would have been better for both players) โ€” it only requires that no single player, acting alone, could do better by switching.

๐Ÿ’ก Memory Trick
Picture two people standing on opposite sides of a seesaw that's perfectly balanced. Neither person has any individual reason to move โ€” if either one shifts position alone, the seesaw tips against THEM specifically, making their own situation worse. This exact balance is the Nash Equilibrium: stable not because it's the best possible arrangement for the seesaw overall, but because neither individual person, acting alone, benefits from changing their own position given where the other person is currently standing.
Finding a Nash Equilibrium
Checking Every Combination for Unilateral Improvement
1
Check Each Player's Best Response
For each possible strategy the OTHER player might choose, determine what YOUR best response would be โ€” this is called a 'best response function,' and doing this for every player across every possible combination is the systematic method for finding Nash Equilibria.
2
Identify Where Best Responses Align
A Nash Equilibrium occurs at exactly the combination of strategies where EVERY player is simultaneously playing their own best response to what everyone else is doing โ€” if you can find even one player who would want to switch given the others' current choices, that combination is NOT a Nash Equilibrium.
3
A Game Can Have Multiple (or Zero) Pure-Strategy Nash Equilibria
Some games have exactly one Nash Equilibrium, some have multiple, and some have none in 'pure strategies' (requiring more advanced 'mixed strategy' analysis, which combines strategies with certain probabilities) โ€” the Prisoner's Dilemma happens to have exactly one Nash Equilibrium (both betray), which also happens to be a dominant-strategy equilibrium, though not every Nash Equilibrium involves dominant strategies.
Why This Matters for Oligopoly Analysis
Predicting the Actual Stable Outcome in Strategic Markets

Nash Equilibrium is exactly the tool that lets economists predict the actual, STABLE real-world outcome in an Oligopoly, where firms are strategically interdependent โ€” rather than just describing the range of POSSIBLE outcomes, Nash Equilibrium identifies which specific outcome the market will actually settle into, since it's the only combination where no single firm has an incentive to unilaterally change its pricing or output decision.

This connects directly back to why Oligopoly collusion is inherently unstable: an agreement to jointly hold prices high is typically NOT a Nash Equilibrium, since at least one firm usually has an individual incentive to secretly break the agreement and undercut its rivals โ€” the ACTUAL Nash Equilibrium in many oligopoly pricing games ends up being a more competitive outcome than firms would collectively prefer, exactly mirroring the Prisoner's Dilemma structure from the Game Theory lesson.

๐Ÿ–ฅ๏ธ Applied Scenario
Two competing coffee shop chains are each deciding whether to price their signature latte at $4 or $5, with profit outcomes depending on both chains' choices, and analysts want to identify the game's Nash Equilibrium.
1
You check each combination systematically: if Chain A prices at $5 while Chain B prices at $4, would Chain A want to switch to $4 given Chain B's choice? You check the payoff matrix and find Chain A would indeed earn more by matching Chain B's lower price.
2
You check the reverse combination and other combinations similarly, verifying at each one whether either chain would benefit from unilaterally switching, given what the other chain is currently doing.
3
You find that the ONLY combination where NEITHER chain wants to unilaterally switch is both pricing at $4 โ€” at this point, Chain A pricing higher would lose it customers to Chain B, and vice versa, meaning both are simultaneously playing their best response to the other.
4
Conclusion: both chains pricing at $4 is the game's Nash Equilibrium โ€” the stable, predictable real-world outcome โ€” even if both chains would have collectively earned more profit had they both somehow held to $5, illustrating exactly why Nash Equilibrium doesn't require the collectively best outcome, only individual stability given what everyone else is doing.
๐Ÿ“Œ Exam Application
Exam questions frequently give you a payoff matrix for two or more players and ask you to identify the Nash Equilibrium (or Equilibria) by systematically checking whether any player would benefit from unilaterally switching strategies. You may also be asked to explain why a Nash Equilibrium doesn't necessarily represent the best collective outcome for all players.
โš ๏ธ Most Common Nash Equilibrium Mistakes
The most common mistake is confusing a Nash Equilibrium with simply 'the best outcome' for all players collectively โ€” a Nash Equilibrium only requires that no INDIVIDUAL player benefits from unilaterally deviating, which can be, and often is, worse for everyone collectively than some other combination that isn't stable (like the Prisoner's Dilemma's 'both stay silent' outcome, which is NOT a Nash Equilibrium despite being better for both players). Another frequent error is checking only ONE player's incentive to deviate and stopping there โ€” a true Nash Equilibrium requires verifying that EVERY player, not just one, has no incentive to unilaterally switch given what everyone else is doing.
โœ“ Quick Self-Test
Given a payoff matrix for two players, can you systematically identify the Nash Equilibrium (or Equilibria) by checking each player's incentive to unilaterally deviate? Can you explain, using a specific example, why a Nash Equilibrium doesn't necessarily represent the best possible outcome for all players collectively?
Next Lesson
Price Discrimination (Examples)
โ†’
โ† All Market Structures Lessons