54 search results - page 3 / 11 » Complexity Results about Nash Equilibria |
SAGT
2010
Springer
13 years 4 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...
ATAL
2010
Springer
13 years 7 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...
SIGECOM
2006
ACM
14 years 9 days ago
2006
ACM
We present a reduction from graphical games to Markov random fields so that pure Nash equilibria in the former can be found by statistical inference on the latter. Our result, wh...
SIGECOM
2010
ACM
13 years 11 months 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...
CSL
2009
Springer
14 years 28 days ago
2009
Springer
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...