Nash equilibrium

Also found in: Dictionary, Acronyms, Wikipedia.
Related to Nash equilibrium: Dominant strategy, John Nash
Graphic Thesaurus  🔍
Display ON
Animation ON
  • noun

Words related to Nash equilibrium

(game theory) a stable state of a system that involves several interacting participants in which no participant can gain by a change of strategy as long as all the other participants remain unchanged

References in periodicals archive ?
The resource allocation process is formulated as a dynamic bidding game, the existence of Nash Equilibrium is proved, and the equilibrium pricing strategy is deduced.
Therefore, the best strategy for it is cooperation strategy, and there exists the only one Nash equilibrium (cooperation, noncooperation).
We test the Nash equilibrium prediction of these games, which is identical in all of them, under a perfect-stranger matching protocol that allows a group of paired participants to play each game only once.
1]; it can be seen that if the system is in stable condition, after a finite game the system can be stable in the Nash equilibrium, then profit of each manufacturer or retailer is stable.
After this concise and elegant definition of the equilibrium point, now known as Nash equilibrium, follows an existence proof using the Kakutani fixed-point theorem.
By solving the conditions for both firms simultaneously, Nash equilibrium in price strategies can be obtained.
198) For example, there could be a mixed strategy Nash equilibrium in which the criminal innovates with a probability of one-third (and does not innovate with a probability of two-thirds), and in which LEOs investigate with a probability of three-fourths (and do not investigate with a probability of one-fourth).
There are two Nash equilibriums in this game model: centralization, do not work hard; and decentralization, work hard, and the appearance of each of these depends on the specific situation.
Keywords: Justice; Mediation; Strategy; Confession; Pareto efficiency; Nash Equilibrium.
The multi-agent machine learning community has observed that for no-regret algorithms, play converges to a correlated equilibrium as shown in Foster (1995), whereas only under additional restrictions can convergence to a Nash equilibrium be guaranteed, as in Jafari et al.
Since each authority is doing the best it can, given what the other authority is doing, this outcome appears to be a Nash equilibrium.
In its most basic view, the Nash equilibrium is a point where no individual has incentive to deviate from their preferred choice.
Nash equilibrium, for example -- the influential theory of John Nash, a mathematician portrayed in several films and the book "A Beautiful Mind" -- would predict that everyone will end up at random places with equal probability for each round.
Solving the system of linear equations composed by two firms' reaction functions leads to the following Nash equilibrium product quantity of two firms and the total production quantity of two firms:
Informally, a Nash equilibrium can be described as follows: If there is a set of strategies for a game with the property that no player can increase the payoff by changing its strategy while the other players keep their strategies unchanged, then that set of strategies and the corresponding payoffs constitute a Nash equilibrium.