── ── Strategy

Nash Equilibrium

A Nash equilibrium is a stable point in multi-player interaction: a combination of strategies where no player can improve their payoff by unilaterally changing their own strategy, given others hold theirs fixed. Key properties: (1) best-response logic — the equilibrium is a fixed point of mutual best-responses; (2) equilibria can be Pareto-suboptimal (prisoner's dilemma); (3) multiple equilibria are common; (4)…

How it works

Step 1 — Specify the game: Players · Actions per player · Payoff matrix or game tree · Information structure (full vs. private) · Sequential or simultaneous.

Step 2 — Best-response analysis: For each player, find the optimal action given each combination of others' strategies. The combination where everyone is best-responding is a Nash equilibrium.

Step 3 — Identify all equilibria: Pure-strategy (deterministic) and mixed-strategy (randomized). If multiple equilibria, identify the most plausible focal point.

When to use it

• user asks 'what will they do if we do X', 'how will competitors react to our pricing', 'how do I design this auction or mechanism', 'we keep ending up in a bad outcome even though everyone prefers better', or is analyzing a strategic situation with multiple rational counterparties (pricing, negotiation, M&A, regulation, platform launch)

Worked example

Nash 1950-51 and the FCC Auctions 1994

John Forbes Nash Jr. (1928-2015) wrote his doctoral dissertation at Princeton in 1950, at age 21. The thesis was 28 pages. From it came the 1950 PNAS paper (two pages) and the 1951 Annals of Mathematics paper (10 pages). For these two papers — establishing the equilibrium concept that bears his name — Nash received the 1994 Nobel Memorial Prize in Economic Sciences (shared with Reinhard Selten and John Harsanyi for the broader development of non-cooperative game theory).