The effectiveness of Stackelberg strategies and tolls for network congestion games

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 07-09-January-2007, Issue , 2007, Pages 1133-1142

  Swamy, Chaitanya ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONVEX OPTIMIZATION; COSTS; ECONOMIC AND SOCIAL EFFECTS; GRAPHIC METHODS; NETWORK ROUTING;

ASYMMETRIC GAMES; HETEROGENEOUS USERS; LATENCY FUNCTION; NETWORK CONGESTION GAME; NETWORK MANAGERS; PERFORMANCE DEGRADATION; ROUTING STRATEGIES; SERIES-PARALLEL GRAPH;

FLOW GRAPHS;

EID: 84969262566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (29)

1. B. Awerbuch, Y. Azar, and A. Epstein. The price of routing unsplittable flow. Proc. 37th STOC, pages 57-66, 2005.
2. M. Beckman, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956.
3. I. Caragiannis, C. Kaklamanis, and P. Kanellopoulos. Taxes for linear atomic congestion games. Proc. 14th ESA, pages 184-195, 2006.
4. G. Christodoulou and E. Koutsoupias. The price of anarchy of finite congestion games. Proc. 37th STOC, pages 67-73, 2005.
5. R. Cole, Y. Dodis, and T. Roughgarden. How much can taxes help selfish routing? Journal of Computer and System Sciences, 72:444-467, 2006.
6. R. Cole, Y. Dodis, and T. Roughgarden. Pricing network edges for heterogeneous selfish users. Proc. 35th STOC, pages 521-530, 2003.
7. R. Cominetti, J. R. Correa, and N. Stier-Moses. Network games with atomic players. Proc. 33rd ICALP, pages 525-536. Springer, 2006.
8. J. Correa and N. Stier-Moses. A note on Stackelberg routing. Unpublished manuscript, September 2006.
9. J. R. Correa, A. S. Schulz, and N. Stier-Moses. Fast, fair, and efficient flows in networks. Proc. 10th IPCO, pages 59-73. Springer, 2004.
10. R. B. Dial. Network-optimized road pricing: Part i: A parable and a model. Operations Research, 47(1):54-64, 1999.
11. L. Fleischer, K. Jain, and M. Mahdian. Tolls for heterogeneous selfish users in multicommodity networks and generalized congestion games. Proc. 45th FOCS, pages 277-285, Rome, Italy, 2004.
12. Lisa Fleischer. Linear tolls suffice: New bounds and algorithms for tolls in single source networks. Theoretical Computer Science, 348:217-225, 2005.
13. Ara Hayrapetyan, É. Tardos, and T. Wexler. The effect of collusion in congestion games. Proc. 38th STOC, pages 89-98, 2006.
14. A. Kaporis and P. Spirakis. The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions. Proc. 18th SPAA, pages 19-28, 2006.
15. G. Karakostas and S. Kolliopoulos. Edge pricing of multicommodity networks for heterogeneous users. Proc. 45th FOCS, pages 268-276, 2004.
16. G. Karakostas and S. Kolliopoulos. Stackelberg strategies for selfish routing in general multicommodity networks. Technical report, McMaster University, June 2006.
17. Y. A. Korilis, A. A. Lazar, and A. Orda. Achieving network optima using Stackelberg routing strategies. IEEE/ACM Transactions on Networking, 5(1):161-173, 1997.
18. Elias Koutsoupias and C. Papadimitriou. Worst-case equilibria. Proc. 16th STACS, pages 404-413, 1999.
19. V. S. A. Kumar and A. Marathe. Improved results for Stackelberg scheduling strategies. Proc. 29th ICALP, 2002.
20. A. Orda, R. Rom, and N. Shimkin. Competitive routing in multiuser communication networks. IEEE/ACM Transactions on Networking, 1:510-521, 1993.
21. C. H. Papadimitriou. Algorithms, games, and the internet.
22. A. C. Pigou. The Economics of Welfare. Macmillan, 1920.
23. T. Roughgarden. Selfish Routing and the Price of Anarchy. MIT Press, 2005.
24. T. Roughgarden. Stackelberg scheduling strategies. SIAM J. Computing, 33(2):332-350, 2004.
25. T. Roughgarden. The price of anarchy is independent of the network topology. Journal of Computer and System Sciences, 67(2):341-364, 2003.
26. T. Roughgarden and É. Tardos. How bad is selfish routing? Journal of the ACM, 49:236-259, 2002.
27. Y. Sharma and D. P. Williamson. Stackelberg thresholds in network routing games or the value of altruism. Unpublished manuscript, August 2006.
28. J. G. Wardrop. Some theoretical aspects of road traffic research. In Proc. Institute of Civil Engineers, Pt. II, volume 1, pages 325-378. 1952.
29. H. Yang and H. J. Huang. The multi-class, multicriteria traffic network equilibria and system optimum problem. Transportation Research B, 28:1-15, 2004.