108 search results - page 3 / 22 » Computing Approximate Nash Equilibria in Network Congestion ... |
WAOA
2005
Springer
13 years 12 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...
MOR
2010
13 years 4 months ago
2010
We develop first-order smoothing techniques for saddle-point problems that arise in the Nash equilibria computation of sequential games. The crux of our work is a construction of ...
SIGECOM
2005
ACM
14 years 4 hour ago
2005
ACM
We introduce a new class of games, congestion games with failures (CGFs), which extends the class of congestion games to allow for facility failures. In a basic CGF (BCGF) agents ...
SAGT
2010
Springer
13 years 4 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...
WINE
2010
Springer
13 years 4 months ago
2010
Springer
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open que...