55 search results - page 6 / 11 » Settling the Complexity of Computing Two-Player Nash Equilib... |
WINE
2010
Springer
13 years 8 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...
SIGECOM
2010
ACM
14 years 3 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...
ATAL
2010
Springer
13 years 12 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 9 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...
CSL
2009
Springer
14 years 5 months 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...