1087 search results - page 10 / 218 » Dynamics in congestion games |
SIROCCO
2008
13 years 10 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 3 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 3 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 ...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
—Most theoretical research on routing games in telecommunication networks has so far dealt with reciprocal congestion effects between routed entities. Yet in networks that suppor...
WICON
2008
13 years 10 months ago
2008
We consider congestion games in wireless sensor networks that offer quantitatively distinct classes of routing paths. Each routing class is characterized by a service cost. Within...