Selfish routing in non-cooperative networks: A survey

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

Volumn 2747, Issue , 2003, Pages 21-45

  Feldmann, R ^a   Gairing, M ^a   Lücking, Thomas ^a   Monien, Burkhard ^a   Rode, Manuel ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; COMPUTATION THEORY; GAME THEORY; NETWORK ROUTING; PROBABILITY DISTRIBUTIONS; SURVEYS; TELECOMMUNICATION NETWORKS;

COMPLEXITY RESULTS; COORDINATION RATIO; LOSS OF EFFICIENCIES; NETWORK DESIGN PROBLEMS; NONCOOPERATIVE NETWORKS; SPLITTABLE FLOWS; UNSPLITTABLE FLOW; UPPER AND LOWER BOUNDS;

PROBLEM SOLVING;

EID: 33744911424     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45138-9_2     Document Type: Review

References (41)

1. M.J. Beckmann. On the theory of traffic flow in networks. Traffic Quart, 21:109-116, 1967.
2. P. Brucker, J. Hurink, and F. Werner. Improving local search heuristics for some scheduling problems. part ii. Discrete Applied Mathematics, 72:47-69, 1997.
3. M. Beckmann, C.B. McGuire, and C.B. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956.
4. D. Braess. Über ein Paradoxon der Verkehrsplanung. Unternehmensforschung, 12:258-268, 1968.
5. Y. Cho and S. Sahni. Bounds for list schedules on uniform processors. SIAM Journal on Computing, 9(1):91-103, 1980.
6. A. Czumaj and B. Vöcking. Tight bounds for worst-case equilibria. In Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), pages 413-420, 2002.
7. S.C. Dafermos and F.T. Sparrow. The traffic assignment problem for a general network. Journal of Research of the National Bureau of Standards, Series B, Vol. 73B, No. 2, pages 91-118, 1969.
8. E. Even-Dar, A. Kesselmann, and Y. Mansour. Convergence time to nash equilibria. In Proc. of the 30th International Colloquium on Automata, Languages, and Programming (ICALP'03), 2003.
9. R. Feldmann, M. Gairing, T. Lücking, B. Monien, and M. Rode. Nashification and the coordination ratio for a selfish routing game. In Proc. of the 30th International Colloquium on Automata, Languages, and Programming (ICALP'03), 2003.
10. G. Finn and E. Horowitz. A linear time approximation algorithm for multiprocessor scheduling. BIT, 19:312-320, 1979.
11. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, and P. Spirakis. The structure and complexity of nash equilibria for a selfish routing game. In Proc. of the 29th International Colloquium on Automata, Languages, and Programming (ICALP'02), pages 123-134, 2002.
12. J. Feigenbaum, C. Papdimitriou, and S. Shenker. Sharing the cost of multicast transmissions. In Proc. of the 32nd Annual ACM Symposium on the Theory of Computing, pages 218-227, 2000.
13. D.K. Friesen. Tighter bounds for lpt scheduling on uniform processors. SIAM Journal on Computing, 16(3):554-560, 1987.
14. M.R. Garey and D.S. Johnson. Computers and intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
15. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, and P. Spirakis. Extreme nash equilibria. Technical report, FLAGS-TR-03-10, University of Paderborn, 2002.
16. R:L. Graham. Bounds on multiprocessing timing anomalies. SIAM Journal of Applied Mathematics, 17(2):416-429, 1969.
17. A. Haurie and P. Marcotte. On the relatonship between nash-cournot and wardrop equilibria. Networks, 15:295-308, 1985.
18. D.S. Hochbaum and D. Shmoys. Using dual approximation algorithms for scheduling problems: Theoretical and practical results. Journal of the ACM, 34(1):144-162, 1987.
19. D.S. Hochbaum and D. Shmoys. A polynomial approximation scheme for scheduling on uniform processors: using the dual approximation approach. SIAM Journal on Computing, 17(3):539-551, 1988.
20. O. Jahn, R.H. Möhring, A.S. Schulz, N.E. Stier Moses. System-Optimal Routing of Traffic Flows With User Constraints in Networks With Congestion. MIT Sloan School of Management Working Paper No. 4394-02, 2002.
21. K. Jain and V. Vazirani. Applications of approximation algorithms to cooperative games. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01), pages 364-372, 2001.
22. Y.A. Korilis, A.A. Lazar, and A. Orda. Architecting noncooperative networks. IEEE Journal on Selected Areas in Communications, 13(7):1241-1251, 1995.
23. E. Koutsoupias and C. Papadimitriou. Worst-case equilibria. In Proc. of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS'99), pages 404-413, 1999.
24. E. Koutsoupias, M. Mavronicolas, and P. Spirakis. Approximate Equilibria and Ball Fusion In Proc. of the 9th International Colloquium on Structural Information and Communication Complexity (SIROCCO'02), 2002, (accepted for TOCS).
25. T. Lücking, M. Mavronicolas, B. Monien, M. Rode, P. Spirakis, and I. Vrto. Which is the worst-case nash equilibrium? In Proc. of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'03), 2003.
26. J.K. Lenstra, D.B. Shmoys, and E. Tardos. Approximation algorithms for scheduling unrelated parallel machines. In Proc. of the 28th Annual Symposium on Foundations of Computer Science (FOCS'87), pages 217-224, 1987.
27. R.D. McKelvey and A. McLennan. Computation of equilibria in finite games. In H. Amman, D. Kendrick, and J. Rust, editors, Handbook of Computational Economics, 1996.
28. M. Mavronicolas and P. Spirakis. The price of selfish routing. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01), pages 510-519, 2001.
29. J. Nash. Non-cooperative games. Annals of Mathematics, 54(2):286-295, 1951.
30. N. Nisan. Algorithms for selfish agents. In Proc. of the 16th International Symposium on Theoretical Aspects of Computer Science (STACS'99), pages 1-15, 1999.
31. N. Nisan and A. Ronen. Algorithmic mechanism design. In Proc. of the 31st ACM Symposium on Theory of Computing (STOC'99), pages 129-140, 1999.
32. M.J. Osborne and A. Rubinstein. A Course in Game Theory. The MIT Press, 1994.
33. C.H. Papadimitriou. On the complexity of the parity argument and other inefficient proofs of existence. Journal of Computer and System Science, 48(3):498-532, 1994.
34. C.H. Papadimitriou. Algorithms, games, and the internet. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01), pages 749-753, 2001.
35. A.C. Pigou. The economics of welfare. Macmillan, 1920.
36. T. Roughgarden and E. Tardos. How bad is selfish routing? Journal of the ACM, 49(2):236-259, 2002.
37. T. Roughgarden. Designing Networks for Selfish Users is Hard. In Proc. of the 42nd Annual ACM Symposium on Foundations of Computer Science (FOCS'017), pages 472-481, 2001.
38. T. Roughgarden. The Price of Anarchy is Independent of the Network Topology. In Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC'02), pages 428-437, 2002.
39. A.S. Schulz and N.E. Stier Moses. On The Performance of User Equilibria in Traffic Networks. MIT Sloan School of Management Working Paper No. 4274-02, 2002.
40. P. Schuurman and T. Vredeveld. Performance guarantees of load search for multiprocessor scheduling. In Proc. of the 8th Conference on Integer Programming and Combinatorial Optimization (IPCO'01), pages 370-382, 2001.
41. J.G. Wardrop. Some theoretical aspects of road traffic research. In Proc. of the Institute of Civil Engineers, Pt. II, Vol. 1, pages 325-378, 1952.