Zero-sum game

Sometimes, one person's win is another person's loss.

It is like sharing one cake. If you take a big piece, there is less for your friend. The total amount of cake stays the same.

Many games work this way. Chess and poker are examples. In these games, one player wins while the other loses.

But some things are not like this. Trading apples for bananas can help both people. In that case, everyone can win.

Math helps us study these different ways of playing.

Imagine you are sharing one cake with a friend. If you take a very large piece, your friend gets a smaller piece. The total amount of cake does not change. In math, we call this a zero-sum game.

In these games, one person's gain is another person's loss. If you add up all the wins and losses, the total is zero. Many games work this way. Chess, poker, and bridge are all zero-sum games. In these games, one player wins and another loses.

But not everything is a zero-sum game. Some situations are called non-zero-sum. This means people can both win or both lose. For example, one country might trade extra bananas for extra apples. Both sides get something they need. This makes the total benefit more than zero.

Math helps us find the best way to play. One way is called the minimax theorem. This helps players pick the best moves. Another idea is the Nash equilibrium. This is a way to find a steady balance in a game.

Imagine you are sharing one single cake with a friend. If you take a very large piece, your friend must receive a smaller piece. The total amount of cake stays exactly the same. In mathematics, we call this a zero-sum game.

This happens because one person's gain is equal to the other person's loss. If you add up all the wins and all the losses, the final sum is zero. This is why these are also called strictly competitive games. The total benefit for everyone involved does not change.

In these games, players are often trying to win points or money. One player wants to maximize their own profit. At the same time, the opponent wants to minimize that profit.

You can see this in many common activities. Games like chess, poker, and bridge are all zero-sum games. In a match, one person wins and another person loses. Even in financial markets, some things like options contracts work this way. Every dollar gained by one person is lost by someone else.

Math helps us find the best way to play these games. Two thinkers, Émile Borel and John von Neumann, found a clever way to solve them. They realized that players could use probability to make decisions. Instead of picking just one move, players can use a random device. This helps them pick moves based on certain chances. This method is called the minimax theorem. It helps players choose a strategy that minimizes their biggest possible loss.

There are also ways to find a steady balance in a game. This balance is called a Nash equilibrium. For a two-player zero-sum game, this can be found using linear programming. This is a mathematical way to solve problems with many rules. If a game has a payoff matrix, we can use it to find the best moves. A payoff matrix is just a chart that shows the results of different choices.

Using these tools, players can find the most optimal way to act.

Not every situation in life is a zero-sum game. Some situations are called non-zero-sum games. In these cases, the total amount of gain or loss can be more or less than zero. For example, two countries can trade extra bananas for extra apples. In this trade, both sides actually benefit from the deal. This is different from a zero-sum game where the pie cannot be made larger. Non-zero-sum games can be competitive or they can be non-competitive.

A zero-sum game is a mathematical model used in game theory and economic theory. It describes a situation involving two or more competing entities. In these scenarios, the result is an advantage for one side and an equivalent loss for the other. This means one player's gain is exactly equal to another player's loss. If you add all the gains and subtract all the losses, the net result is zero. Because the total benefit remains unchanged, these are often called strictly competitive games.

To understand the mechanism, imagine a payoff matrix. This is a chart used to represent the possible outcomes of a game. In a two-player game, the first player might choose an action in secret. The second player also chooses an action without knowing the first player's choice. Once both choices are revealed, points are allocated according to the matrix. For example, if Red chooses action 2 and Blue chooses action B, Red might gain 20 points while Blue loses 20 points. The players act based on these values, attempting to maximize their own profit while the opponent tries to minimize it.

Zero-sum games are a specific type of constant sum game. In these games, the sum of each outcome is always zero. They are considered distributive rather than integrative. This means the "pie" cannot be enlarged through negotiation. This is a key distinction from non-zero-sum games. In a non-zero-sum situation, the aggregate gains and losses can be more or less than zero. For instance, if one country trades excess bananas for another country's excess apples, both sides benefit. This trade creates a situation where the total benefit is greater than zero.

History shows that mathematicians found clever ways to solve these competitive puzzles. Émile Borel and John von Neumann provided fundamental insights using probability. They realized that instead of choosing one definite action, players could use a mixed strategy. This involves assigning probabilities to different actions and using a random device to choose between them. This approach leads to the minimax theorem. The minimax method helps players compute optimal strategies by minimizing the maximum expected point loss.

Another important concept is the Nash equilibrium. For two-player finite zero-sum games using mixed strategies, an equilibrium solution always exists. In these cases, the different solution concepts of Nash equilibrium, minimax, and maximin all yield the same result. This is not necessarily true for pure strategies. Finding a Nash equilibrium can be done by solving a linear programming problem. This mathematical method uses a vector to find the probability that a player will choose a specific strategy. If a payoff matrix contains negative numbers, a constant can be added to make all elements positive without changing the equilibrium strategies.

Zero-sum dynamics appear in many real-world sectors. In financial markets, derivatives trading is often seen as a zero-sum game. Every dollar gained by one party in a transaction is lost by the other. Options contracts are a specific example of this wealth transfer. Even in aviation, market entries can create zero-sum effects. In Hong Kong, the entry of low-cost airlines brought in $671 million in revenue but resulted in an outflow of $294 million. If the number of arriving and departing flights remains the same, the economic contribution might become a zero-sum game due to the displacement of existing models.

Complexity increases when more than two players are involved. In a zero-sum three-person game, there is an absolute antagonism of interests. A single move by one player might benefit them while disbenefiting both other players. It is also possible for two players to find a parallelism of interests. This means they might cooperate to the detriment of the third player.

For example, if Player 1 chooses defense while Players 2 and 3 choose offense, both attackers gain a point while the defender loses two. This shows how players can adjust their conduct to build temporary alliances within a competitive framework.