Papalocal
Loading…
Papalocal · Things
Work

Nash equilibrium

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 their own strategy.

All 2 facts, and where they come from

Facts

2 facts · 0 confirmed by two sources · 0 cited · 2 from one source

What it is
type of equilibrium One source
Named after
John Forbes Nash One source

Where this comes from

Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.

What Wikidata says · copied November 16, 2026 · revision 2515830104
Described as
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 their own strategy
Other names
Nash solution
What it is
type of equilibrium
Named after
John Forbes Nash
Wikipedias with a page
50

Wikidata item Q23389 (wikidata.org/wiki/Q23389), public domain (CC0). Copied 2026-11-16.

What Wikipedia says · copied November 16, 2026 · revision 1384659027

In game theory, a Nash equilibrium is a situation where no player could gain more by changing their own strategy (holding all other players' strategies fixed) in a game. A Nash equilibrium is the most commonly used solution concept for non-cooperative games.
If each player has chosen a strategy — an action plan based on what has happened so far in the game — and no individual player can increase their own expected payoff by changing their strategy while the other players keep theirs unchanged, then the current set of strategy choices constitutes a Nash equilibrium.
If two players Alice and Bob choose strategies A and B, (A, B) is a Nash equilibrium if Alice has no other strategy available that does better than A at maximizing her payoff in response to Bob choosing B, and Bob has no other strategy available that does better than B at maximizing his payoff in response to Alice choosing A. In a game in which Carol and Dan are also players, (A, B, C, D) is a Nash equilibrium if A is Alice's best response to (B, C, D), B is Bob's best response to (A, C, D), and so forth.
The concept of a Nash equilibrium dates back to the time of Cournot, who in 1838 applied it to his model of competition in an oligopoly. John Nash showed that there is a Nash equilibrium, possibly in mixed strategies, for every finite game.

From the Wikipedia article “Nash equilibrium” (en.wikipedia.org/wiki/Nash_equilibrium), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-16; not changed.

Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.

People connected 1

Known for it