Sciweavers

Share
34 search results - page 1 / 7
» Congestion Games, Load Balancing, and Price of Anarchy
Sort
View
CAAN
2004
Springer
10 years 4 months ago
Congestion Games, Load Balancing, and Price of Anarchy
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...
Anshul Kothari, Subhash Suri, Csaba D. Tóth...
ICALP
2007
Springer
10 years 4 months ago
Strong Price of Anarchy for Machine Load Balancing
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...
Amos Fiat, Haim Kaplan, Meital Levy, Svetlana Olon...
INFOCOM
2010
IEEE
9 years 9 months ago
Price of Anarchy in Non-Cooperative Load Balancing
We investigate the price of anarchy of a load balancing game with K dispatchers. The service rates and holding costs are assumed to depend on the server, and the service disciplin...
Urtzi Ayesta, Olivier Brun, Balakrishna Prabhu
MST
2011
184views Hardware» more  MST 2011»
9 years 5 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks
STOC
2005
ACM
122views Algorithms» more  STOC 2005»
10 years 11 months ago
The price of anarchy of finite congestion games
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 ( ...
George Christodoulou, Elias Koutsoupias
books