Sciweavers

12 search results - page 1 / 3
» Strong Price of Anarchy for Machine Load Balancing
Sort
View
ICALP
2007
Springer
13 years 11 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...
DAGSTUHL
2007
13 years 6 months ago
Equilibria for two parallel links: The strong price of anarchy versus the price of anarchy
Following recent interest in the strong price of anarchy (SPOA), we consider this measure, as well as the well known price of anarchy (POA) for the job scheduling problem on two u...
Leah Epstein
SODA
2007
ACM
115views Algorithms» more  SODA 2007»
13 years 6 months ago
Strong price of anarchy
A strong equilibrium (Aumann 1959) is a pure Nash equilibrium which is resilient to deviations by coalitions. We define the strong price of anarchy to be the ratio of the worst c...
Nir Andelman, Michal Feldman, Yishay Mansour
INFOCOM
2010
IEEE
13 years 3 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
CAAN
2004
Springer
13 years 10 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...