Selfish load balancing and atomic congestion games

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn 16, Issue , 2004, Pages 188-195

  Suri, Subhash ^a   Tóth, Csaba D ^a   Zhou, Yunhong ^b  

^a University of California   (United States)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

Congestion Game; Greedy Algorithm; Load Balancing; Nash Equilibrium; Price of Anarchy

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECENTRALIZED CONTROL; GRAPH THEORY; OPTIMIZATION; SERVERS; SET THEORY;

ATOMIC CONGESTION GAMES; GREEDY ALGORITHMS; LOAD BALANCING; LOWER BOUNDS; NASH EQUILIBRIUM (NE); PRICE OF ANARCHY;

CLIENT SERVER COMPUTER SYSTEMS;

EID: 8344224445     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007912.1007941     Document Type: Conference Paper

References (16)

1. N. Alon, Y. Azar, G. J. Woeginger, and T. Yadid. Approximation schemes for scheduling. In Proc. 8th SODA, 1997, pp. 493-500.
2. p norm. Algorithmica 29 (3) (2001), 422-441.
3. p Norm. Proc. 36th FOCS, IEEE Comp. Soc. Press, 1995, pp. 383-391.
4. A. K. Chandra and C. K. Wong. Worst-case analysis of a placement algorithm related to storage allocation. SIAM J. Computing 4 (3) (1975), 249-263.
5. R.A. Cody and E. G. Coffman. Record allocation for minimizing expected retrieval costs on drum-like storage devices. Journal of the ACM 23 (1) (1976), 103-115.
6. A. Czumaj and B. Vöcking. Tight bounds for worst-case equilibria. Proc. 13th SODA, ACM Press, 2002, pp. 413-420.
7. R. L. Graham. Bounds for certain multiprocessor anomalies. Bell System Technical Journal 45 (1966), 1563-1581.
8. E. Koutsoupias and C. Papadimitriou. Worst-case Equilibria. Proc. 16th STACS, LNCS, Vol. 1563, 1999. Springer-Verlag, pp. 404-413.
9. J. K. Lenstra, D. B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming: Ser. A 46 (3) (1990), 259-271.
10. S. Muthukrishnan and R. Rajaraman. An adversarial model for distributed dynamic load balancing. In Proc. 10th SPAA, 1998, pp. 47-54.
11. C. Papadimitriou. Algorithms, games, and the internet. Proc. 33rd ACM Symposium on Theory of Computing, ACM Press, 2001, pp. 749-753.
12. S. Phillips and J. Westbrook. Online load balancing and network flow. In Proc 25th STOC, ACM Press, 1993, pp. 402-411.
13. R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2 1973, 65-67.
14. D. B. Shmoys, J. Wein, and D. P. Williamson. Scheduling parallel machines on-line. SIAM J. Computing 24 (6) (1995), 1313-1331.
15. T. Roughgarden. Selfish Routing. PhD thesis, Cornell University, 2002.
16. T. Roughgarden and É. Tardos. How bad is selfish routing? Journal of ACM 49 (2002), 235-259.