constant-sum game
Quick Summary
In game theory, a constant-sum game is a situation where the total gains and losses for all players add up to zero. This means that any advantage one player gains is directly at the expense of another player. These games are also known as zero-sum games.12
Examples of constant-sum games include chess, checkers, and Go, which are games of perfect information. In these games, players can use all available information to deduce optimal strategies, leading to a predetermined outcome. However, in situations without a clear "saddlepoint" (a best strategy for all players), game theory prescribes using mixed strategies, which involve choosing actions based on probability distributions. The minimax theorem states that every finite, two-person constant-sum game has a solution, either in pure or mixed strategies.34
Ask Britannica AI about this topic
Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.

