35 search results - page 1 / 7 » Recent development in computational complexity characterizat... |
CSR
2007
Springer
13 years 5 months ago
2007
Springer
FOCS
2006
IEEE
13 years 11 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...
SIAMCOMP
2010
13 years 3 months ago
2010
We reexamine what it means to compute Nash equilibria and, more generally, what it means to compute a fixed point of a given Brouwer function, and we investigate the complexity o...
ATAL
2007
Springer
13 years 11 months ago
2007
Springer
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
SAGT
2010
Springer
13 years 3 months ago
2010
Springer
We consider the computational complexity of coalitional solution concepts in scenarios related to load balancing such as anonymous and congestion games. In congestion games, Paret...