The Nash equilibrium reference article from the English Wikipedia on 24-Jul-2004 (provided by Fixed Reference: snapshots of Wikipedia from wikipedia.org)

# Nash equilibrium

Connect with a children's charity on your social network
The Nash equilibrium is a concept in game theory originated by John Nash, who was awarded The Bank of Sweden Prize in Economic Sciences in Memory of Alfred Nobel, effectively the Nobel Prize in economics, for his work in the area. It serves to define a kind of "optimum" strategy for games where no such optimum was previously defined. A basic definition is this: If there is a set of strategies for a game with the property that no player can benefit by changing his strategy while the other players keep their strategies unchanged, then that set of strategies and the corresponding payoffs constitute a Nash equilibrium.

This definition applies to games of two or more players, and Nash showed that the various definitions of "solutions" for games that had been given earlier all yield Nash equilibria.

As a simple example, consider the following two-player game: both players simultaneously choose a whole number between 0 and 10, inclusive. Both players then win the minimum of the two numbers in dollars. In addition, if one player choses a larger number than the other, then he has to pay \$2 to the other. This game has a unique Nash equilibrium: both players have to choose 0. Any other choice of strategies can be improved if one of the players lowers his number. If the game is modified so that the two players win the named amount if they both choose the same number, and otherwise win nothing, then there are 11 Nash equilibria.

If a game has a unique Nash equilibrium and is played among completely rational players, then the players will choose the strategies that form the equilibrium.

A game may have many Nash equilibria, or none. Nash was able to prove that, if we allow mixed strategies (players choose strategies randomly according to preassigned probabilities), then every n-player game in which every player can choose from finitely many strategies admits at least one Nash equilibrium of mixed strategies.

### Example: Coordination Game

Here is a classic two person game bi-matrix, person A is usually on the left (and corresponds to the first number in the pair) person B is usually listed on the top (and corresponds to the second number of the pair).

This game is a coordination game for driving. The choices are either to drive on the left or to drive on the right, with 100 meaning no crash and 0 meaning a crash.

 Drive on the Left: Drive on the Right: Drive on the Left: 100,100 0,0 Drive on the Right: 0,0 100,100

In this case there are two nash equilbria, when both choose to either drive on the left or on the right.