Nash equilibrium

Imagine you and a friend play a game. You both make a plan. You do not want to change your plan. Your friend does not want to change theirs either.

It is called a Nash equilibrium. It is named after John Nash. He was a math expert.

In this game, everyone's choice depends on others. You must think about what others do. You cannot win more by switching your plan alone.

This idea helps us study many things. It can help us understand traffic. It can even help us study soccer.

Math helps us see how people make choices.

Imagine you and a friend are playing a game. You both make a plan. You look at your friend's plan. You decide not to change yours. Your friend looks at your plan, too. They also decide not to change theirs. No one can do better by switching alone. This special moment is called a Nash equilibrium.

This idea is named after John Nash. He was a famous math expert. He proved that these stable points exist in many games. Before him, a man named Antoine Cournot used a similar idea. He studied how companies compete to make money.

We use this math to study the real world. It helps us understand how traffic flows on roads. It can even help us study soccer players taking penalty kicks. Experts use it to look at how robots move through crowds. It even helps us study how banks work. By looking at everyone's choices at once, we can see how groups act.

Imagine you are playing a game with several friends. Each person must choose a plan, which math experts call a strategy. To understand the game, you cannot just look at your own plan. You must also think about what everyone else will do. A Nash equilibrium happens when everyone has made a choice. At this point, no single player can get a better result by changing their plan alone. Everyone else keeps their plan exactly the same. It is a stable moment where no one has a reason to switch.

This idea works like a balanced scale. Let us look at how it works step by step. Suppose Alice and Bob are playing a game. Alice picks plan A, and Bob picks plan B. For this to be a Nash equilibrium, Alice must look at Bob's plan B. She must decide if plan A is her best response to his choice. Then, Bob looks at Alice's plan A. He must decide if plan B is his best response to her choice. If neither of them wants to change, they have found an equilibrium.

People have studied these patterns for a long time. In 1838, Antoine Augustin Cournot used a similar idea. He studied how different companies compete to make money. He looked at how much each firm should produce to get the most profit. This was a very early version of the concept. Later, John von Neumann and Oskar Morgenstern wrote a famous book in 1944. They studied games where one person's gain is another's loss. Finally, John Forbes Nash Jr. changed everything with his work in 1951. He proved that a Nash equilibrium exists for every finite game.

John Nash used clever math to prove his ideas. He showed that even if players use mixed strategies, an equilibrium exists. A mixed strategy is when a player uses a probability to pick a plan. This means they might not choose the same thing every single time. Nash used a math tool called a fixed-point theorem to make his proof. This allowed him to show that these stable points are not just lucky accidents. They are a real part of how games work. Even when players have many different choices, a stable point can be found.

We use this math to understand many parts of our world. It helps experts study how traffic flows through a city. It can even help us understand how soccer players take penalty kicks. Scientists use it to see how robots move through busy crowds. It is also used to study how banks work during a crisis. We can even use it to look at how people protect the environment. By using Nash's ideas, we can see how many different people make choices together. It shows us how many small decisions create one big result.

In game theory, a Nash equilibrium is a stable state within a strategic interaction. It occurs when every player has chosen a strategy that is a best response to the strategies chosen by everyone else. In this state, no individual player can increase their own expected payoff by changing their strategy while the other players keep theirs fixed. This concept is the most common solution concept used for non-cooperative games. It allows researchers to predict how different decision-makers might behave when their outcomes depend on the choices of others.

The mechanism of a Nash equilibrium relies on the idea of unilateral deviation. Imagine a group of players, such as Alice, Bob, Carol, and Dan. Each player selects a specific strategy, which is an action plan based on the current state of the game. If Alice chooses strategy A, Bob chooses B, Carol chooses C, and Dan chooses D, this set is a strategy profile. For this profile to be a Nash equilibrium, Alice's choice of A must be her best response to the combination of B, C, and D. Simultaneously, Bob's choice must be his best response to A, C, and D. Every player must find that staying with their current choice is optimal, assuming no one else changes.

There are different types of equilibria based on how players choose their actions. A pure-strategy Nash equilibrium occurs when players choose one specific action with total certainty. In contrast, a mixed-strategy Nash equilibrium involves players choosing a probability distribution over several possible strategies. This means a player might choose different actions at different times based on calculated probabilities. Equilibria can also be classified by their stability. A strict Nash equilibrium is one where every player would suffer a loss if they changed their strategy. A weak or non-strict equilibrium occurs if a player is indifferent, meaning another strategy would provide the exact same payoff.

The history of this concept spans over a century of mathematical development. In 1838, Antoine Augustin Cournot applied similar logic to his theory of oligopoly. He studied how several firms choose their production levels to maximize profit. In a Cournot equilibrium, each firm's output is a best response to the output of its competitors. Later, in 1944, John von Neumann and Oskar Morgenstern introduced mixed-strategy equilibria in their book, "The Theory of Games and Economic Behavior." However, their work was limited to zero-sum games, where one player's gain is exactly equal to another's loss. It was John Forbes Nash Jr. who revolutionized the field in 1951. He defined mixed-strategy Nash equilibrium for any game with a finite set of actions and proved that at least one such equilibrium must always exist.

Nash's proof was a major mathematical breakthrough because it applied to all finite games. He used advanced mathematical tools, specifically the Brouwer fixed-point theorem, to demonstrate that these stable points are guaranteed to exist. This was a significant expansion from von Neumann's work, which only covered specific cases. Nash showed that even when players use probabilities to make decisions, a point of stability can be found. This existence proof allows economists and scientists to use the concept as a reliable tool for analyzing complex systems.

The applications of Nash equilibrium are incredibly diverse and touch many parts of modern life. Game theorists use it to analyze hostile situations like wars and arms races. It helps researchers understand how people cooperate in different settings, such as the "battle of the sexes" or the "stag hunt." In economics, it is used to study the adoption of technical standards, the behavior of auctions, and the occurrence of bank runs or currency crises. Even in sports, the concept can be applied to analyze how players execute penalty kicks in football.

Beyond social sciences, the concept connects to engineering and environmental management. It is used to model traffic flow through cities via Wardrop's principle and to assist in robot navigation through crowded spaces. Experts also apply it to energy systems, transportation systems, and wireless communications. In environmental science, it helps analyze the "tragedy of the commons," which describes how shared resources are managed. Whether studying how multiple parties exert effort in education or how to organize regulatory legislation, the Nash equilibrium provides a framework for understanding how individual decisions shape collective outcomes.