Abstract
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsoupias and Papadimitriou to measure the performance degradation due to the lack of a centralized traffic regulating authority. We provide a full characterization of the worst-case coordination ratio in the restricted assignment and unrelated parallel links models. In particular, we quantify the tradeoff between the ”negligibility” of the traffic controlled by each user and the coordination ratio. We analyze both pure and mixed strategies systems and identify the range where their performance is similar.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Cole, R., Dodis, Y., Roughgarden, T.: How much can taxes help selfish routing? In: Proc. 4th Annual ACM Conference on Electronic Commerce, pp. 98–107 (2003)
Cole, R., Dodis, Y., Roughgarden, T.: Pricing network edges for heterogeneous selfish users. In: Proc. 35th ACM Symp. on Theory of Computing, pp. 521–530 (2003)
Czumaj, A., Krysta, P., Vöcking, B.: Selfish traffic allocation for server farms. In: Proc. 34th ACM Symp. on Theory of Computing, pp. 287–296 (2002)
Czumaj, A., Vöcking, B.: Tight bounds for worst-case equilibria. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pp. 413–420 (2002)
Koutsoupias, E., Papadimitriou, C.H.: Worst-case equilibria. In: Proc. 16th Symp. on Theoretical Aspects of Comp. Science, pp. 404–413 (1999)
Mavronicolas, M., Spirakis, P.: The price of selfish routing. In: Proc. 33rd ACM Symp. on Theory of Computing, pp. 510–519 (2001)
Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)
Papadimitriou, C.H.: Algorithms, games and the internet. In: Proc. 33rd ACM Symp. on Theory of Computing, pp. 749–753 (2001)
Roughgarden, T.: Designing networks for selfish users is hard. In: Proc. 42nd IEEE Symp. on Found. of Comp. Science, pp. 472–481 (2001)
Roughgarden, T.: How unfair is optimal routing? In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pp. 203–204 (2002)
Roughgarden, T.: The price of anarchy is independent of the network topology. In: Proc. 34th ACM Symp. on Theory of Computing, pp. 428–437 (2002)
Roughgarden, T., Tardos, É.: How bad is selfish routing. In: Proc. 41st IEEE Symp. on Found. of Comp. Science, pp. 93–102 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Awerbuch, B., Azar, Y., Richter, Y., Tsur, D. (2004). Tradeoffs in Worst-Case Equilibria. In: Solis-Oba, R., Jansen, K. (eds) Approximation and Online Algorithms. WAOA 2003. Lecture Notes in Computer Science, vol 2909. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24592-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-540-24592-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21079-5
Online ISBN: 978-3-540-24592-6
eBook Packages: Springer Book Archive