Nash Equilibrium

In game theory, the Nash equilibrium is a solution concept of a non-cooperative game involving two or more players, in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his own strategy unilaterally. If each player has chosen a strategy and no player can benefit by changing his or her strategy while the other players keep theirs unchanged, then the current set of strategy choices and the corresponding payoffs constitute a Nash equilibrium.

Stated simply, Amy and Phil are in Nash equilibrium if Amy is making the best decision she can, taking into account Phil's decision, and Phil is making the best decision he can, taking into account Amy's decision. Likewise, a group of players are in Nash equilibrium if each one is making the best decision that he or she can, taking into account the decisions of the others.

Read more about Nash Equilibrium:  Applications, History, Stability, Occurrence, NE and Non-credible Threats, Computing Nash Equilibria

Famous quotes containing the words nash and/or equilibrium:

    Better yet, if called by a panther,
    Don’t anther.
    —Ogden Nash (1902–1971)

    They who feel cannot keep their minds in the equilibrium of a pair of scales: fear and hope have no equiponderant weights.
    Horace Walpole (1717–1797)