Why your best move depends entirely on someone else's choices
In short: In many scenarios, you cannot win alone because your success is tied to the actions of others. Game theory turns this social complexity into a branch of applied mathematics, providing a framework to calculate optimal strategies when every participant is trying to outthink one another.
Game theory analyzes interactive decision-making where outcomes depend on the collective actions of all participants, known as players. Because these decisions are interdependent, each player must formulate a strategy by considering not only their own goals but also the possible moves of their rivals. This creates a recursive loop: you must think about what they will do, while recognizing that they are simultaneously thinking about what you will do. This interdependence forces players to anticipate how others will react to their own potential moves. Because of this, the science attempts to systematize what might otherwise seem like an arcane art of human intuition.
The field originated in the 1920s with John von Neumann and Oskar Morgenstern, who focused on 'zero-sum' games where one player's gain is exactly equal to another's loss. However, John Nash expanded this into more realistic models involving mixed interests and multiple players. These theories are now applied across diverse fields, including biology—to study the Darwinian struggle for survival—as well as economics, politics, law, and war. Modern evolutionary theory maintains close links with these mathematical models. Furthermore, theorists like Reinhard Selten and John Harsanyi have explored games involving sequences of moves or unequal information access.
A key tool for analyzing these interactions is the payoff matrix, which maps out different choices and their resulting rewards. Within this framework, researchers identify 'dominant strategies' or a 'Nash equilibrium.' The latter represents a point of convergence where the complex chain of thinking about thinking stabilizes. In certain two-person constant-sum games with perfect information, such as chess, these outcomes can be strictly determined; however, in more complex scenarios, finding the optimal path remains an enduring intellectual challenge. A saddlepoint denotes the result selected by logical actors who identify a row's lowest value that simultaneously serves as a column's highest figure within a payoff matrix. For example, in chess, there are approximately 1043 distinct 40-move games possible.
Opens the Intellect+ feed with this card first. Swipe up for the next one.
Sources
- Summary by Intellect · source: Game Theory Explained | Analyzing a Payoff Matrix
- Also: Game theory | Definition, Facts, & Examples | Britannica
- Also: Game Theory Explained | American Experience | PBS
To cite this card, link to https://intellectplus.co.uk/app/ideas-game-theory-explained.
How we source, check and correct cards: Editorial standards.
General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.
Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?
Related
More in Game theory · More in Ideas & Philosophy · Latest · A–Z · All topics
