Approximating wardrop equilibria with finitely many agents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4731 LNCS, Issue , 2007, Pages 238-252

  Fischer, Simon ^a   Olbrich, Lars ^a   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; MATHEMATICAL MODELS; RESOURCE ALLOCATION; ROUTING ALGORITHMS; USER INTERFACES;

APPROXIMATE EQUILIBRIA; LOAD-DEPENDENT LATENCY; WARDROP EQUILIBRIA;

INTELLIGENT AGENTS;

EID: 38049000443     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75142-7_20     Document Type: Conference Paper

References (19)

1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, algorithms and applications. Prentince-Hall, Englewood Cliffs (1993)
2. Awerbuch, B., Khandekar, R.: Greedy distributed optimization of multi-commodity flows. In: Proc. 26th Ann. Symp. on Principles of Distributed Computing (PODC) (2007)
3. Awerbuch, B., Khandekar, R., Rao, S.: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In: Proc. 18th Ann. Symp. on Discrete Algorithms (SODA) (2007)
4. Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: Distributed learning and geometric approaches. In: Proc. 36th Ann. Symp. on Theory of Comput. (STOC), pp. 45-53 (2004)
5. Beckmann, M., McGuire, C.B., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven and London (1956)
6. Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: Proc. 17th Ann. Symp. on Discrete Algorithms (SODA) (2006)
7. Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific (1998)
8. Blum, A., Even-Dar, E., Ligett, K.: Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games. In: Proc. 25th Ann. Symp. on Principles of Distributed Computing (PODC), pp. 45-52. ACM, New York (2006)
9. Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proc. 4th Conf. on Electronic Commerce, pp. 98-107 (2003)
10. Cominetti, R., Correa, J.R., Moses, N.E.S.: Network games with atomic players. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4052, pp. 525-536. Springer, Heidelberg (2006)
11. Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proc. 16th Ann. Symp. on Discrete Algorithms (SODA), pp. 772-781 (2005)
12. Fischer, S., Räcke, H., Vöcking, B.: Fast convergence to Wardrop equilibria by adaptive sampling methods. In: Proc. 38th Symposium on Theory of Computing (STOC), pp. 653-662. ACM, New York (2006)
13. Fischer, S., Vöcking, B.: Adaptive routing with stale information. In: Aguilera, M.K., Aspnes, J. (eds.) Proc. 24th Symp. on Principles of Distributed Computing (PODC), pp. 276-283. ACM, New York (2005)
14. Fleischer, L.: Linear tolls suffice: New bounds and algorithms for tolls in single source networks. In: Diaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 544-554. Springer, Heidelberg (2004)
15. Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer, load-balancing game. In: Proc. 23rd Symp. on Principles of Distributed Computing (PODC), pp. 131-140. ACM, New York (2004)
16. Hagerup, T., Rub, C.: A guided tour of Chernoff bounds. Information Processing Letters 33, 305-308 (1990)
17. Roughgarden, T.: How unfair is optimal routing? In: Proc. 13th Ann. Symp. on Discrete Algorithms (SODA), pp. 203-204 (2002)
18. Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236-259 (2002)
19. Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proc. of the Institute of Civil Engineers, Pt. II, vol. 1, pp. 325-378 (1952)