23 search results - page 1 / 5 » Computing Pure Nash Equilibria in Symmetric Action Graph Gam... |
67
Voted
AAAI
2007
15 years 11 hour ago
2007
SIGECOM
2010
ACM
15 years 2 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...
UAI
2004
14 years 11 months ago
2004
Action-graph games (AGGs) are a fully expressive game representation which can compactly express both strict and context-specific independence between players' utility functi...
STACS
2007
Springer
15 years 3 months ago
2007
Springer
Strategic games may exhibit symmetries in a variety of ways. A characteristic feature, enabling the compact representation of games even when the number of players is unbounded, i...
88
Voted
ATAL
2007
Springer
15 years 3 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...