Atomic selfish routing in networks: A survey

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

Volumn 3828 LNCS, Issue , 2005, Pages 989-1002

  Kontogiannis, Spyros ^a,b   Spirakis, Paul ^b  

^a UNIVERSITY OF IOANNINA   (Greece)

^b UNIVERSITY OF PATRAS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ASYMPTOTIC STABILITY; GAME THEORY; INFORMATION DISSEMINATION; ROUTERS; SURVEYS;

ALGORITHMIC QUESTIONS; ATOMIC SELFISH ROUTING; NASH EQUILIBRIA; SOCIAL OPTIMA;

COMPUTER NETWORKS;

EID: 33744932679     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11600930_100     Document Type: Conference Paper

References (27)

1. Anshelevich E., Dasgupta A., Kleinberg J., Tardos E., Wexler T., Roughgarden T. The price of stability for network design with fair cost allocation. In Proc. of the 45th IEEE Symp. on Foundations of Computer Science (FOCS '04), pages 295-304, 2004.
2. Anshelevich E., Dasgupta A., Tardos E., Wexler T. Near-optimal network design with selfish agents. In Proc. of the 35th ACM Symp. on Theory of Computing (STOC '03), pages 511-520, 2004.
3. Awerbuch B., Azar Y., Epstein A. The price of routing unsplittable flow. In Proc. of the 37th ACM Symp. on Theory of Computing (STOC '05), pages 57-66, 2005.
4. G. Christodoulou and E. Koutsoupias. The Price of Anarchy of Finite Congestion Games. In Proc. of the 37th ACM Symp. on Theory of Computing (STOC '05), pages 67-73, 2005.
5. Czumaj A., Krysta P., Voecking B. Selfish traffic allocation for server farms. In Proc. of the 34th ACM Symp. on Theory of Computing (STOC '02), pages 287-296, 2002.
6. Czumaj A., Voecking B. Tight bounds for worst-case equilibria. In Proc. of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pages 413-420, 2002.
7. Even-Dar E., Kesselman A., Mansour Y. Convergence time to nash equilibria. In Proc. of the 30th International Colloquium on Automata, Languages and Programming (ICALP '03), pages 502-513. Springer-Verlag, 2003.
8. Fabrikant A., Papadimitriou C., Talwar K. The complexity of pure nash equilibria. In Proc. of the 36th ACM Symp. on Theory of Computing (STOC '04), 2004.
9. Feldmann R., Gairing M., Luecking T., Monien B., Rode M. Nashification and the coordination ratio for a selfish routing game. In Proc. of the 30th International Colloquium on Automata, Languages and Programming (ICALP '03), pages 514-526. Springer-Verlag, 2003.
10. Fotakis D., Kontogiannis S., Koutsoupias E., Mavronicolas M., Spirakis P. 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. Springer-Verlag, 2002.
11. Fotakis D., Kontogiannis S., Spirakis P. Selfish unsplittable flows. In Proc. of the 31st International Colloquium on Automata, Languages and Programming (ICALP '04), pages 593-605. Springer-Verlag, 2004.
12. Fotakis D., Kontogiannis S., Spirakis P. Symmetry in network congestion games: Pure equilibria and anarchy cost. In Proc. of the 3rd Workshop on Approximation and Online Algorithms (WAOA '05). Springer-Verlag, 2005.
13. Gairing M., Luecking T., Mavronicolas M., Monien B., Spirakis P. Extreme nash equilibria. In Proc. of the 8th Italian Conference on Theoretical Computer Science (ICTCS '03). Springer-Verlag, 2003.
14. Hochbaum D., Shmoys D. A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM J. Comput., 17(3):539-551, 1988.
15. Johari R., Tsitsiklis J. Efficiency loss in a network resource allocation game. To appear in the Mathematics of Operations Research, 2004.
16. Johnson D., Papadimitriou C., Yannakakis M. How easy is local search? J. of Computer and System Sciences, 37:79-100, 1988.
17. Koutsoupias E., Mavronicolas M., Spirakis P. Approximate equilibria and ball fusion. ACM Transactions on Computer Systems, 36:683-693, 2003.
18. Koutsoupias E., Papadimitriou C. Worst-case equilibria. In Proc. of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS '99), pages 404-413. Springer-Verlag, 1999.
19. Libman L., Orda A. Atomic resource sharing in noncooperative networks. Telecommunication Systems, 17(4):385-409, 2001.
20. Lücking T., Mavronicolas M., Monien B., Rode M. A new model for selfish routing. In Proc. of the 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS '04), pages 547-558. Springer-Verlag, 2004.
21. Lücking T., Mavronicolas M., Monien B., Rode M., Spirakis P., Vrto I. Which is the worst-case nash equilibrium? In 26th International Symposium on Mathematical Foundations of Computer Science (MFCS'03), pages 551-561. Springer-Verlag, 2003.
22. Mavronicolas M., Spirakis P. The price of selfish routing. In Proc. of the 33rd ACM Symp. on Theory of Computing (STOC '01), pages 510-519, 2001.
23. Milchtaich I. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13:111-124, 1996.
24. Monderer D., Shapley L. Potential games. Games and Economic Behavior, 14:124-143, 1996.
25. Rosenthal R.W. A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
26. Roughdarden T., Tardos E. How bad is selfish routing? J. Assoc. Comput. Mach., 49(2):236-259, 2002.
27. Roughgarden T. The price of anarchy is independent of the network topology. In Proc. of the 34th ACM Symp. on Theory of Computing (STOC '02), pages 428-437, 2002.