Nash Equilibrium

Source: John Forbes Nash Jr., PNAS, 1950; Nobel Prize 1994

Finding

Nash proved that every finite game with mixed strategies has at least one Nash equilibrium: a state where no player can improve their outcome by unilaterally changing strategy. The proof uses Kakutani’s fixed-point theorem. The prisoner’s dilemma (Tucker, 1950) has a unique Nash equilibrium where both players defect, yielding an outcome worse for both than mutual cooperation. The equilibrium is stable but Pareto-dominated. This demonstrates that alignment between individual rationality and collective good is not automatic. Game theory reveals the structural conditions under which individual and collective interests align or diverge.

Pattern Mapping

Alignment — A Nash equilibrium is, by definition, a state where each player’s strategy and optimal action are consistent given others’ strategies. No one has incentive to deviate. But the prisoner’s dilemma shows individual alignment does not guarantee collective alignment.

Proportion — Pareto optimality asks: is the outcome proportional? Nash equilibria that are not Pareto-optimal represent structural disproportion — the system produces less than it could.

Honesty — Nash’s result is honest about what game theory can and cannot do. It identifies stable states; it does not claim those states are good. Positive (what is) vs. normative (what ought to be).

Connections

Status

Nash (1950, 1951) is foundational. Prisoner’s dilemma is standard (Axelrod, The Evolution of Cooperation, 1984). See also Schelling, The Strategy of Conflict (1960). The mapping is this project’s structural interpretation.


The mapping to the five properties is this project’s structural interpretation.