Equilibrium points in n-person games

In this foundational paper, John Nash introduces the concept of an equilibrium point for n-person games. While previous work by von Neumann and Morgenstern had established solutions for two-person zero-sum games, Nash generalizes this to any finite game involving any number of players. He defines an equilibrium point as a set of strategies—one for each player—such that no player has an incentive to deviate from their chosen strategy, assuming the other players keep their strategies unchanged.

The core of the paper is the proof that such an equilibrium point must exist for every finite game. Nash utilizes the concept of mixed strategies, where players choose their actions according to a probability distribution. By mapping the strategy space to itself, he demonstrates that the game's structure satisfies the conditions of Kakutani's fixed-point theorem. This theorem guarantees that there is at least one point that remains invariant under the transformation, which corresponds to the equilibrium state of the game.

This result is a cornerstone of modern game theory. By proving that equilibria exist in a broad class of games, Nash provided a rigorous framework for analyzing strategic interactions in economics, political science, and biology. It shifted the focus from purely competitive zero-sum scenarios to a more nuanced understanding of how rational agents interact in complex environments where outcomes depend on the collective choices of all participants.