Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Competition Yields Efficiency in Load Balancing Games
 

Summary: Competition Yields Efficiency in
Load Balancing Games
Jonatha Anselmi (BCAM)
Urtzi Ayesta (LAAS-CNRS)
Adam Wierman (Caltech)
Load balancing game
DECISION
Each user seeks to minimize its own mean sojourn time
Load balancing game (cont.)
Well studied model: [Bell&Stidham83],[Haviv &
Roughgarden07], [A.BrunPrabhu10].
Existence, Uniqueness of equilibria [BS83].
Results:
- [RT02] Linear latency functions PoA=4/3
- [HR07] M/M/1-type latency, PoA=N.
- [AAP11] M/M/1 with server dependent costs, unbounded
PoA
- [CMW09] SRPT-type, PoA unbounded with 2 servers
Increasing efficiency
­Stackelberg

  

Source: Ayesta, Urtzi - Laboratoire d'Analyse et d'Architecture des Systèmes du CNRS

 

Collections: Engineering