142 search results - page 8 / 29 » Computing Nash Equilibria: Approximation and Smoothed Comple... |
SIGECOM
2010
ACM
14 years 11 days ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We present several new characterizations of correlated equilibria in games with continuous utility functions. These have the advantage of being more computationally and analytical...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
SAGT
2010
Springer
13 years 6 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
IJCAI
2003
13 years 9 months ago
2003
We describe algorithms for computing Nash equilibria in structured game representations, including both graphical games and multi-agent influence diagrams (MAIDs). The algorithms...