Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Nash equilibrium

Known as: Weak Nash equilibrium, Governing dynamics, Nash theorem (in game theory) 
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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2018
Review
2018
Peer-to-peer (P2P) energy trading has emerged as a next-generation energy-management mechanism for the smart grid that enables… Expand
  • figure 1
  • table I
  • table II
  • figure 2
  • figure 3
Is this relevant?
Review
2018
Review
2018
The electric vehicle (EV) market has been growing rapidly around the world. With large scale deployment of EVs in power systems… Expand
  • table I
  • figure 2
  • table II
  • figure 1
  • figure 3
Is this relevant?
Highly Cited
2017
Highly Cited
2017
Generative Adversarial Networks (GANs) excel at creating realistic images with complex models for which maximum likelihood is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In 1951, John F. Nash proved that every game has a Nash equilibrium [Ann. of Math. (2), 54 (1951), pp. 286-295]. His proof is… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We address the problem of spectrum pricing in a cognitive radio network where multiple primary service providers compete with… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
We resolve the question of the complexity of Nash equilibrium by showing that the problem of computing a Nash equilibrium in a… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
2006
Highly Cited
2006
  • X. Chen, X. Deng
  • 47th Annual IEEE Symposium on Foundations of…
  • 2006
  • Corpus ID: 14102058
Even though many people thought the problem of finding Nash equilibria is hard in general, and it has been proven so for games… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1995
Highly Cited
1995
Sufficient conditions for Nash equilibrium in an 'n'-person game are given in terms of what the players know and believe - about… Expand
  • figure 4.3
  • figure 4.2
  • figure 4.6
  • figure 7.3
  • figure 7.1
Is this relevant?
Highly Cited
1993
Highly Cited
1993
Two players are about to play a discounted infinitely repeated bimatrix game. Each player knows his own payoff matrix and chooses… Expand
Is this relevant?
Highly Cited
1952
Highly Cited
1952
Abstract : Kakutani's Fixed Point Theorem states that in Euclidean n-space a closed point to (non-void) convex set map of a… Expand
Is this relevant?