What Is Game Theory?
Game theory is the mathematical study of strategic interaction — situations where the outcome for each participant depends not just on their own decisions, but on the decisions of others. A "game" in this technical sense has three components: players (the decision-makers), strategies (the choices available to each player), and payoffs (the outcomes associated with each combination of strategies). John von Neumann and Oskar Morgenstern established the mathematical foundations in their 1944 book Theory of Games and Economic Behavior. Von Neumann had already proved the minimax theorem for zero-sum games in 1928 — showing that in any two-player zero-sum game, both players have optimal strategies that minimise their maximum possible loss. Nash's 1950 contribution extended this to non-zero-sum games with any number of players, providing a general equilibrium concept that von Neumann's minimax could not capture.
Payoff Matrices and Strategic Form
The simplest game — two players, two strategies each — is represented as a 2×2 payoff matrix. Each cell shows the payoffs to both players for the corresponding combination of strategies. The convention is (Row player's payoff, Column player's payoff):
The Nash Equilibrium: Stable Outcomes
A Nash equilibrium is a strategy profile — one strategy choice for each player — such that no player can improve their payoff by changing their own strategy, holding all other players' strategies fixed. It is the point where everyone is playing the best possible response to what everyone else is doing. Nash's proof that every finite game has at least one Nash equilibrium (possibly in mixed strategies) was a major mathematical achievement. The proof uses Kakutani's fixed-point theorem — showing that the best-response correspondence has a fixed point. Existence is guaranteed; uniqueness is not. Many games have multiple Nash equilibria, raising the question of which equilibrium rational players will coordinate on — the equilibrium selection problem, which remains an active research area.
The Prisoner's Dilemma: When Individual Rationality Fails Collective Welfare
The prisoner's dilemma is the most famous example in game theory because it demonstrates that individually rational choices can lead to collectively worse outcomes than cooperation would achieve: The prisoner's dilemma structure appears everywhere: arms races (both nations arm despite both preferring disarmament), price wars (both firms cut prices despite both preferring high prices), environmental tragedy of the commons (each farmer overgrazes despite collective interest in restraint). The dilemma resolves when the game is repeated indefinitely — the "shadow of the future" creates incentives for cooperation that single-shot play cannot sustain. Robert Axelrod's famous computer tournament in the 1980s showed that Tit-for-Tat — cooperate first, then mirror the opponent's last move — wins in repeated prisoner's dilemma.
Mixed Strategies: Randomising Deliberately
Some games have no pure strategy Nash equilibrium — the rock-paper-scissors structure where any predictable strategy can be exploited. The solution is a mixed strategy: randomising between pure strategies with specific probabilities that make the opponent indifferent between their options.
Game Theory in Engineering
Game theory has moved well beyond economics into engineering, particularly in systems where multiple autonomous agents interact. Network routing protocols can be modelled as games where each data packet's path choice affects congestion experienced by others. Cognitive radio systems where multiple radios compete for spectrum use Nash equilibria to model stable frequency allocations. Mechanism design — inverse game theory, designing rules to produce desired equilibrium outcomes — underlies auction formats used to allocate spectrum licences worth billions of dollars. Cybersecurity is a natural application domain: attackers and defenders engage in a strategic interaction where each party best-responds to the other's strategy. Game-theoretic security models identify situations where defenders are systematically disadvantaged by the asymmetric information or resource constraints of the attacker, informing where to concentrate defensive resources. Traffic equilibrium models (Wardrop equilibrium) predict how drivers route themselves through a network, with counterintuitive results like Braess's paradox — adding a road can increase congestion under selfish routing.