The price of routing unsplittable flow

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2005, Pages 57-66

  Awerbuch, Baruch ^a   Azar, Yossi ^b   Epstein, Amir ^b  

^a Johns Hopkins University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Game theory; Nash equilibria; Selfish routing; Unsplittable flow

Indexed keywords

COMPUTATION THEORY; GAME THEORY; MATHEMATICAL MODELS; POLYNOMIALS; REAL TIME SYSTEMS; TELECOMMUNICATION TRAFFIC;

NASH EQUILIBRIA; SELFISH ROUTING; UNSPLITTABLE FLOW;

ROUTERS;

EID: 34848900496     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060590.1060599     Document Type: Conference Paper

References (26)

1. p norm. In Proc. of the 36th Annual Symposium on Foundations of Computer Science (FOCS95), pages 383-391, 1995.
2. B. Awerbuch, Y. Azar, Y. Richter, and D. Tsur. Tradeoffs in worst-case equilibria. In Proceedings of 1st WAOA, pages 41-52, 2003.
3. M. Beckmann, C.B. McGuire, and C.B. Winsten. Studies in Economics of Transportation. Yale University Press, 1956.
4. G. Christodoulou and E. Koutsoupias. The price of anarchy of finite congestion games. In Proc. 37th ACM Symp. on Theory of Computing, 2005. To appear.
5. R. Cole, Y. Dodis, and T. Roughgarden. How much can taxes help selfish routing? In Proceedings of the 4th ACM conference on Electronic commerce, pages 98-107, 2003.
6. R. Cole, Y. Dodis, and T. Roughgarden. Pricing network edges for heterogeneous selfish users. In Proc. 35th ACM Symp. on Theory of Computing, pages 521-530, 2003.
7. A. Czumaj, P. Krysta, and B. Vöcking. Selfish traffic allocation for server farms. In Proc. 34th ACM Symp. on Theory of Computing, pages 287-296, 2002.
8. A. Czumaj and B. Vöcking. Tight bounds for worst-case equilibria. In Proc. 13rd ACM-SIAM Symp. on Discrete Algorithms, pages 413-420, 2002.
9. P. Dubey. Inefficiency of nash equilibria. Mathematics of Operations Research, 11(1):1-8, 1986.
10. A. Fabrikant, Christos Papadimitriou, and Kunal Talwar. The complexity of pure equilibria. In Proc. 36th ACM Symp. on Theory of Computing, pages 604-612, 2004.
11. D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish unsplittable flows. In International Colloquium on Automata, Languages and Programming - ICALP '04-to appear.
12. M. Gairing, T. Lücking, M. Mavronicolas, and B. Monien. The price of anarchy for polynomial social cost. In Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science (MFCS 2004), pages 574-585, 2004.
13. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, and M. Rode. Nash equilibria in discrete routing games with convex latency functions. In Proc. of the 31st International Colloquium on Automata, Languages and Programming (ICALP 2004), pages 645-657, 2004.
14. E. Koutsoupias and C.H. Papadimitriou. Worst-case equilibria. In Proc. 16th Symp. on Theoretical Aspects of Comp. Science, pages 404-413, 1999.
15. T. Lücking, M. Mavronicolas, B. Monien, and M. Rode. A new model for selfish routing. In Proc. of the 21st International Symposium on Theoretical Aspects of Computer Science (STACS 2004), pages 547-558, 2004.
16. M. Mavronicolas and P. Spirakis. The price of selfish routing. In Proc. 33rd ACM Symp. on Theory of Computing, pages 510-519, 2001.
17. J. F. Nash. Equilibrium points in n-person games. In Proceedings of National Academy of Sciences, volume 36, pages 48-49, 1950.
18. G. Owen. Game Theory. Academic Press, third edition, 1995.
19. C.H. Papadimitriou. Algorithms, games and the internet. In Proc. 33rd ACM Symp. on Theory of Computing, pages 749-753, 2001.
20. R. W. Rosenthal. A class of games possesing pure-strategy nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
21. T. Roughgarden. Selfish routing with atomic players. In SODA 2005. to appear.
22. T. Roughgarden. Designing networks for selfish users is hard. In Proc. 42nd IEEE Symp. on Found. of Comp. Science, pages 472-481, 2001.
23. T. Roughgarden. The price of anarchy is independent of the network topology. In Proc. 34th ACM Symp. on Theory of Computing, pages 428-437, 2002.
24. T. Roughgarden and E. Tardos. How bad is selfish routing. In Proc. 41st IEEE Symp. on Found. of Comp. Science, pages 93-102, 2000.
25. S. Suri, C. Toth, and Y. Zhou. Selfish load balancing and atomic congestion games. In ACM SPAA '04 (Symp. on Parallelism in Algorithms and Architectures), 2004.
26. J. G. Wardrop. Some theoretical aspects of road traffic research. In Proceedings of the Institute of Civil Engineers, Pt. II, volume 1, pages 325-378, 1952.