3504 search results - page 8 / 701 » Computational Aspects of Equilibria |
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...
SIGECOM
2010
ACM
14 years 1 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...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
We present efficient approximation algorithms for finding Nash equilibria in anonymous games, that is, games in which the players utilities, though different, do not differentia...
UAI
2004
13 years 10 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...
SIROCCO
2008
13 years 10 months ago
2008
We consider the problem of computing -approximate Nash equilibria in network congestion games. The general problem is known to be PLS-complete for every > 0, but the reductions...