65 search results - page 7 / 13 » The Complexity of Nash Equilibria in Infinite Multiplayer Ga... |
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...
SIGECOM
2010
ACM
14 years 16 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...
SIGECOM
2003
ACM
14 years 29 days ago
2003
ACM
We examine correlated equilibria in the recently introduced formalism of graphical games, a succinct representation for multiplayer games. We establish a natural and powerful rela...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
We define the class of games called simulation-based games, in which the payoffs are available as an output of an oracle (simulator), rather than specified analytically or using a...
SIGECOM
2006
ACM
14 years 1 months ago
2006
ACM
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...