Tight bounds for worst-case equilibria

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 413-420

  Czumaj, Artur ^a   Vöcking, Berthold ^b  

^a University Heights   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COORDINATION RATIO; DIFFERENT SPEED; GAME-THEORETIC; PARALLEL LINKS; SELFISH ROUTING; TIGHT BOUND;

GAME THEORY;

EID: 84968906622     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. P. G. Bradford. On worst-case equilibria for the Internet. Manuscript, 2001.
2. G. Gonnet. Expected length of the longest probe sequence in hash code searching. Journal of the Association for Computing Machinery, 28(2):289-304, 1981.
3. E. Koutsoupias and C. H. Papadimitriou. Worst-case equilibria. In C. Meinel and S. Tison, editors, Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 1563 of Lecture Notes in Computer Science, pages 404-413, Trier, Germany, March 4-6, 3999. Springer-Verlag, Berlin.
4. E. Koutsoupias, M. Mavronicolas, and P. Spirakis. Personal communication, 2001.
5. M. Mavronicolas and P. Spirakis. The price of selfish routing. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 510-519, Hersonissos, Crete, Greece, July 6-8, 2001. ACM Press, New York, NY.
6. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.
7. C. H. Papadimitriou. Algorithms, games, and the Internet. In Proceedings of the 33rd Annual ACM Symposium on Theory of Computing (STOC), pages 749-753, Hersonissos, Crete, Greece, July 6-8, 2001. ACM Press, New York, NY.
8. C. H. Papadirnitriou and M. Yannakakis. On complexity as bounded rationality. In Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC), pages 726-733, Montreal, Quebec, Canada, May 23-25, 1994. ACM Press, New York, NY.
9. T. Roughgarden and É. Tardos. How bad is selfish routing? In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pages 93-102, Redondo Beach, CA, November 12-14, 2000. IEEE Computer Society Press, Los Alamos, CA.