Fast convergence to wardrop equilibria by adaptive sampling methods

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 653-662

  Fischer, Simon ^a   Räcke, Harald ^b   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

^b TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

Adaptive routing; Convergence time; Wardrop equilibria

Indexed keywords

ADAPTIVE ALGORITHMS; GAME THEORY; MATHEMATICAL MODELS; PROBABILITY; ROUTERS; TELECOMMUNICATION TRAFFIC;

ADAPTIVE ROUTING; CONVERGENCE TIME; REROUTING POLICIES; WARDROP EQUILIBRIA;

CONVERGENCE OF NUMERICAL METHODS;

EID: 33748096952     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132608     Document Type: Conference Paper

References (24)

1. S. Arora, Y. Rabani, and U. Vazirani. Simulating quadratic dynamical systems is PSPACE-complete. In Proc. 26th Ann. ACM. Symp. on Theory of Comput. (STOC), pages 459-467, 1994.
2. B. Awerbuch and R. D. Kleinberg. Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In Proc. 36th Ann. ACM. Symp. on Theory of Comput. (STOC), pages 45-53, 2004.
3. B. Awerbuch and R. D. Kleinberg. Competitive collaborative learning. In Proc. 18th, pages 233-248, 2005.
4. M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics and Transportation. Yale University Press, 1956.
5. P. Berenbrink, T. Priedetzky, L. A. Goldberg, P. Goldberg, Z. Hu, and R. Martin. Distributed selfish load balancing. In Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), 2006.
6. D. P. Bertsekas and J. N. Tistiklis. Parallel and Distributed Computing: Numerical Methods. Athena Scientific, 1989.
7. A. Slum, E. Even-Dar, and K. Ligett. Routing without regret, 2005. Manuscript.
8. R. Cole, Y. Dodis, and T. Roughgarden. Pricing network edges for heterogeneous selfish users. In Proc. 35th Ann. ACM. Symp. on Theory of Comput. (STOC), pages 521-530, 2003.
9. E. Even-Dar and Y. Mansour. Fast convergence of selfish rerouting. In Proc. 16th Ann. ACM-SIAM Symp. on Discrete. Algorithms (SODA), pages 772-781, 2005.
10. A. Fabrikant, C. Papadimitriou, and K. Talwar. The complexity of pure Nash equilibria. In Proc. 36th Ann. ACM. Symp. on Theory of Comput. (STOC), pages 604-612, 2004.
11. S. Fischer and B. Vöcking. On the evolution of selfish routing. In Proc. 12th Ann. European Symp. on Algorithms (ESA), pages 323-334, 2004.
12. S. Fischer and B. Vöcking. Adaptive routing with stale information. In Proc. 24th Ann. ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing (PODC), pages 276-283, 2005.
13. L. Fleischer. Linear tolls suffice: New bounds and algorithms for tolls in single source networks. In Proc. Slst Int. EATCS Coll. on Automata, Languages and Programming (ICALP), pages 544-554, 2004.
14. A. Kaporis, E. Politopoulou, and P. Spirakis. The price of optimum in Stackelberg games. Technical report, Electronic Colloquium on Computational Complexity (ECCC), 2005.
15. A. Khanna and J. A. Zinky. The revised ARPANET routing metric. In Proc. ACM SIGCOMM, pages 45-56, September 1998.
16. J. F. Kurose and K. W. Ross. Computer Networking, a top down approach featuring the Internet, 3rd ed. Addison-Wesley Longman, 2004.
17. M. Mitzenmacher. How useful is old information? In Proc. 16th Ann. ACM Symp. on Principles of Distributed Computing (PODC), pages 83-91, 1997.
18. Y. Rabinovich, A. Sinclair, and A. Wigderson. Quadratic dynamical systems. In Proc. 33rd Ann. IEEE Symp. on Foundations of Comput. 3d. (FOCS), pages 304-313, 1992.
19. J. Rexford. Handbook of Optimization in Telecommunications, chapter Route optimization in IP networks. Kluwer Academic Publishers, 2005.
20. T. Roughgarden. Stackelberg scheduling strategies. In Proc. 33rd Ann. ACM. Symp. on Theory of Comput. (STOC), pages 104-113, 2001.
21. T. Roughgarden. How unfair is optimal routing? In Proc. 13th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pages 203-204, 2002.
22. T. Roughgarden and E. Tardos. How bad is selfish routing? J. ACM, 49(2):236-259, 2002.
23. J. G. Wardrop. Some theoretical aspects of road traffic research. In Proc. of the Institute of Civil Engineers, Pt. II, pages 325-378, 1952.
24. J. W. Weibull. Evolutionary Game Theory. MIT press, 1995.