117 search results - page 8 / 24 » Altruism in Congestion Games |
STOC
2005
ACM
14 years 10 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 ( ...
CAAN
2004
Springer
14 years 3 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...
SIROCCO
2008
13 years 11 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...
BIRTHDAY
2009
Springer
14 years 4 months 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...
CISS
2008
IEEE
14 years 4 months 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 ...