Approximating Wardrop equilibria with finitely many agents

Distributed Computing

Volumn 21, Issue 2, 2008, Pages 129-139

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Adaptive routing; Wardrop model

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION; COMPUTATIONAL METHODS; COMPUTER NETWORKS; EVOLUTIONARY ALGORITHMS; FINITE DIFFERENCE METHOD; FUNCTION EVALUATION; METROPOLITAN AREA NETWORKS; NETWORK PROTOCOLS; OPTICAL COMMUNICATION; POLYNOMIAL APPROXIMATION; POPULATION STATISTICS; SET THEORY; STABILIZERS (AGENTS);

(MIN ,MAX ,+) FUNCTIONS; APPLIED (CO); APPROXIMATION QUALITY; BALANCE (WEIGHTING); CONVERGENCE TIME; EFFICIENT ALGORITHMS; EXPONENTIAL NUMBERS; FINITE NUMBERS; FINITE SETS; PATH DECOMPOSITION; POLYNOMIAL-TIME; SPRINGER (CO); WARDROP EQUILIBRIUM;

APPROXIMATION ALGORITHMS;

EID: 46349090459     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-008-0057-1     Document Type: Article

References (21)

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: Proceedings of 26th Annual Symposium 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: Proceedings of 18th Annual Symposium on Discrete Algorithms (SODA) (2007)
4. Awerbuch, B., Kleinberg, R.D.: Adaptive routing with end-to-end feedback: distributed learning and geometric approaches. In: Proceedings of 36th Annual Symposium on Theory of Computation (STOC), pp. 45-53 (2004)
5. Beckmann, M., Bart McGuire, C., Winsten, C.B.: Studies in the Economics of Transportation. Yale University Press, New Haven (1956)
6. Berenbrink, P., Friedetzky, T., Goldberg, L.A., Goldberg, P., Hu, Z., Martin, R.: Distributed selfish load balancing. In: Proceedings of 17th Annual Symposium on Discrete Algorithms (SODA) (2006)
7. Bertsekas, D.P.: Network Optimization: Continuous and Discrete Models. Athena Scientific, Belmont (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: Proceedings of 25th Annual Symposium on Principles of Distributed Computing (PODC), pp. 45-52. ACM, Denver, Colorado (2006)
9. Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proceedings of 4th ACM Conference on Electronic Commerce, pp. 98-107 (2003)
10. Cominetti, R., Correa, J.R., Stier Moses, N.E.: Network games with atomic players. In: Proceedings of 33rd International EATCS Coll. on Automata, Languages and Programming (ICALP), pp. 525-536 (2006)
11. Even-Dar, E., Mansour, Y.: Fast convergence of selfish rerouting. In: Proceedings of 16th Annual Symposium on Discrete Algorithms (SODA), pp. 772-781 (2005)
12. Fischer, S.: Dynamic selfish routing. PhD Thesis, Lehrstuhl für Algorithmen und Komplexität, RWTH Aachen (2007)
13. Fischer, S., Räcke, H., Vöcking, B.: Fast convergence to Wardrop equilibria by adaptive sampling methods. In: Proceedings of 38th Annual ACM Symposium on Theory of Computing (STOC), pp. 653-662. ACM, Seattle (2006)
14. Fischer, S., Vöcking, B.: Adaptive routing with stale information. In: Proceedings of 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 276-283. ACM, Las Vegas (2005)
15. Fleischer, L.: Linear tolls suffice: new bounds and algorithms for tolls in single source networks. In: Proceedings of 31st International EATCS Coll. on Automata, Languages and Programming (ICALP), pp. 544-554 (2004)
16. Goldberg, P.W.: Bounds for the convergence rate of randomized local search in a multiplayer, load-balancing game. In: Proceedings of 23rd Annual Symposium on Principles of Distributed Computing (PODC), pp. 131-140. ACM (2004)
17. Hagerup, T., Rüb, C.: A guided tour of Chernoff bounds. Inf. Process. Lett. 33, 305-308 (1990)
18. Ochel, M.: Effiziente Algorithmen für Gleichgewichtsflüsse. Master's Thesis, RWTH Aachen (2007)
19. Roughgarden, T.: How unfair is optimal routing? In: Proceedings of 13th Annual Symposium on Discrete Algorithms (SODA), pp. 203-204 (2002)
20. Roughgarden, T., Tardos, É.: How bad is selfish routing?. J ACM 49(2), 236-259 (2002)
21. Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, Pt. II, vol. 1, pp. 325-378 (1952)