35 search results - page 1 / 7 » Computing pure strategy nash equilibria in compact symmetric... |
SIGECOM
2010
ACM
13 years 9 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...
STACS
2007
Springer
13 years 11 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...
AAAI
2007
13 years 7 months ago
2007
WAOA
2005
Springer
13 years 10 months ago
2005
Springer
We study computational and coordination efficiency issues of Nash equilibria in symmetric network congestion games. We first propose a simple and natural greedy method that comput...
IJCAI
2003
13 years 6 months ago
2003
We present a new class of games, local-effect games (LEGs), which exploit structure in a different way from other compact game representations studied in AI. We show both theoreti...