117 search results - page 8 / 24 » Altruism in Congestion Games |
163
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We consider the price of anarchy of pure Nash equilibria in congestion games with linear latency functions. For asymmetric games, the price of anarchy of maximum social cost is ( ...
184
click to vote
CAAN
2004
Springer
15 years 11 months ago
2004
Springer
Imagine a set of self-interested clients, each of whom must choose a server from a permissible set. A server’s latency is inversely proportional to its speed, but it grows linear...
159
click to vote
SIROCCO
2008
15 years 7 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...
169
click to vote
BIRTHDAY
2009
Springer
16 years 25 days ago
2009
Springer
We introduce a new class of games, asynchronous congestion games (ACGs). In an ACG, each player has a task that can be carried out by any element of a set of resources, and each r...
165
click to vote
CISS
2008
IEEE
16 years 16 days ago
2008
IEEE
—A general framework is developed for networks with flows that use all available congestion signals to regulate their rates. It is conceptually a generalization of the existing ...