33 search results - page 3 / 7 » Congestion Games, Load Balancing, and Price of Anarchy |
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
DFG
2009
Springer
13 years 11 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...
WINE
2007
Springer
13 years 11 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
13 years 10 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...
STOC
2009
ACM
14 years 5 months ago
2009
ACM
The price of anarchy (POA) is a worst-case measure of the inefficiency of selfish behavior, defined as the ratio of the objective function value of a worst Nash equilibrium of a g...