108 search results - page 1 / 22 » Computing Approximate Nash Equilibria in Network Congestion ... |
SIROCCO
2008
13 years 6 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...
ESA
2010
Springer
13 years 6 months ago
2010
Springer
Bottleneck congestion games properly model the properties of many real-world network routing applications. They are known to possess strong equilibria
ACID
2006
13 years 6 months ago
2006
In a congestion game, several players simultaneously aim at allocating sets of resources, e.g., each player aims at allocating a shortest path between a source/destination pair in ...
TCS
2010
12 years 11 months ago
2010
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
MOBIHOC
2012
ACM
11 years 7 months ago
2012
ACM
A key feature of wireless communications is the spatial reuse. However, the spatial aspect is not yet well understood for the purpose of designing efficient spectrum sharing mecha...