Bottleneck links, variable demand, and the tragedy of the commons

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2006, Pages 668-677

  Cole, Richard ^a   Dodis, Yevgeniy ^a   Roughgarden, Tim ^b  

^a POLYTECHNIC UNIVERSITY   (United States)

^b Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTLENECK; FIXED-DEMAND NETWORKS; MULTICOMMODITY NETWORKS; NETWORKING APPLICATIONS;

COSTS; FUNCTIONS; OPTIMIZATION; PROBLEM SOLVING;

BEHAVIORAL RESEARCH;

EID: 33244466547     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1109557.1109630     Document Type: Conference Paper

References (39)

1. A. Akella, S. Chawla, and S. Seshan, Realistic models for selfish routing in the Internet. Manuscript, 2003.
2. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden, The price of stability for network design with fair cost allocation. In Proceedings of the 45th Annual Symposium on Foundations of Computer Science (FOCS), pages 295-304, 2004.
3. E. Anshelevich, A. Dasgupta, É. Tardos, and T. Wexler. Near-optimal network design with selfish agents. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 511-520, 2003.
4. J. Aspnes, K. Chang, and A. Yampolskiy, Inoculation strategies for victims of viruses and the sum-of-squares partition problem. In Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2005. To appear.
5. A. Banerjee and J. Yoo. Minimizing maximum logical link congestion in packet switched optimal networks. In Proceedings of the 1997 IEEE International Conference on Communcations (ICC), volume 3, pages 1298-1302, 1997.
6. R. Banner and A. Orda. Bottleneck games in noncooperative networks. Technical Report CCIT-510, Technion University, 2004.
7. M. J. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956.
8. D. P. Bertsekas and J. N. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Prentice-Hall, 1989. Second Edition, Athena Scientific, 1997.
9. D. Braess. Über ein Paradoxon aus der Verkehrsplanung. Unternehmensforschung, 12:258-268, 1968.
10. J. H. Chang and L. Tassiulas. Energy conserving routing in wireless ad-hoc networks. In Proceedings of INFOCOM, pages 22-31, 2000.
11. C. K. Chau and K. M. Sim. The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. Operations Research Letters, 31(5):327-334, 2003.
12. J. R. Correa, A. S. Schulz, and N. E. Stier Moses. Selfish routing in capacitated networks. Mathematics of Operations Research, 29(4):961-976, 2004.
13. J. R. Correa, A. S. Schulz, and N. E. Stier Moses. On the inefficiency of equilibria in congestion games. In Proceedings of the 11th Conference on Integer Programming and Combinatorial Optimization (IPCO), 2005. To appear.
14. A. Czumaj. Selfish routing on the Internet. In J. Leung, editor, Handbook of Scheduling: Algorithms, Models, and Performance Analysis, chapter 42. CRC Press, 2004.
15. S. C. Dafermos. Traffic equilibrium and variational inequalities. Transportation Science, 14(1):42-54, 1980.
16. A. Fabrikant, A. Luthra, E. Maneva, C. H. Papadimitriou, and S. J. Shenker. On a network creation game. In Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pages 347-351, 2003.
17. N. H. Gartner. Optimal traffic assignment with elastic demands: A review; Part I. Analysis framework. Transportation Science, 14(2):174-191, 1980.
18. M. X. Goemans and D. P. Williamson. The primaldual method for approximation algorithms and its application to network design problems. In D. S. Hochbaum, editor, Approximation Algorithms for NP-Hard Problems, chapter 4, pages 144-191. PWS Publishing Company, 1997.
19. M. M. Halldórsson, J. Y. Halpern, E. L. Li, and V. S. Mirrokni. On spectrum sharing games. In Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pages 107-114, 2004.
20. G. Hardin. The tragedy of the commons. Science, 162:1243-1248, December 13 1968.
21. R. Johari and J. N. Tsitsiklis. Routing and peering in a competitive Internet. Technical Report 2570, MIT LIDS, 2003.
22. R. Johari and J. N. Tsitsiklis. Efficiency loss in a network resource allocation game. Mathematics of Operations Research, 29(3):407-435, 2004.
23. S. Keshav. An Engineering Approach to Computer Networking. Addison-Wesley, 1997.
24. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STAGS), volume 1563 of Lecture Notes in Computer Science, pages 404-413, 1999.
25. A. Nagurney. Network Economics: A Variational Inequality Approach. Kluwer, 1993. Second Edition, 1999.
26. G. Perakis. The price of anarchy when costs are non-separable and asymmetric. In Proceedings of the 10th Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 3064 of Lecture Notes in Computer Science, pages 46-58, 2004.
27. L. Qiu, Y. R. Yang, Y. Zhang, and S. Shenker. On selfish routing in Internet-like environments. In Proceedings of SIGCOMM, pages 151-162, 2003.
28. R. W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2(1):65-67, 1973.
29. T. Roughgarden. Designing networks for selfish users is hard. In Proceedings of the 42d Annual Symposium on Foundations of Computer Science (FOCS), pages 472-481, 2001.
30. T. Roughgarden. The price of anarchy is independent of the network topology. Journal of Computer and System Sciences, 67(2):341-364, 2003.
31. T. Roughgarden. Selfish Routing and the Price of Anarchy. MIT Press, 2005.
32. T. Roughgarden and É. Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
33. T. Roughgarden and E. Tardos. Bounding the inefficiency of equilibria in nonatomic congestion games. Games and Economic Behavior, 49(2):389-403, 2004.
34. D. Schmeidler. Equilibrium points of nonatomic games. Journal of Statistical Physics, 7(4):295-300, 1973.
35. M. J. Smith. The existence, uniqueness and stability of traffic equilibria. Transportation Research, Part B, 13(4):295-304, 1979.
36. E. Tardos. Course notes. Cornell CS684, 2004.
37. A. Vetta. Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In Proceedings of the 43rd Annual Symposium on Foundations of Computer Science (FOCS), pages 416-425, 2002.
38. Y. Wang and Z. Wang. Explicit routing algorithms for Internet traffic engineering. In Proceedings of the 8th International Conference on Computer Communications and Networks (ICCN), pages 582-588, 1999.
39. 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.