19 search results - page 2 / 4 » The price of anarchy of finite congestion games |
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
115
click to vote
DFG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We give an overview of important results for non-atomic congestion games in their traditional form along with self-contained and short proofs and then present new results...
127
click to vote
CAAN
2004
Springer
15 years 5 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...
WINE
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. In this work, we consider singleton congestion games as a special class of (weighted) congestion games where each players' strategy consists only of a single resourc...
WAOA
2005
Springer
15 years 5 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...