16 search results - page 2 / 4 » Symmetries and the Complexity of Pure Nash Equilibrium |
SIGECOM
2006
ACM
13 years 11 months 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...
WINE
2010
Springer
13 years 3 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...
CSL
2009
Springer
14 years 2 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...
SIGECOM
2003
ACM
13 years 10 months ago
2003
ACM
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
SIGECOM
2006
ACM
13 years 11 months ago
2006
ACM
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...