The price of selfish routing

Algorithmica (New York)

Volumn 48, Issue 1, 2007, Pages 91-126

  Mavronicolas, Marios ^a   Spirakis, Paul ^b,c  

^a UNIVERSITY OF CYPRUS   (Cyprus)

^b UNIVERSITY OF PATRAS   (Greece)

^c University of Patras and Computer Technology Institute   (Greece)

Author keywords

Coordination ratio; Fully mixed Nash equilium; Nash equilibria; Selfish routing

Indexed keywords

COORDINATION RATIO; FULLY MIXED NASH EQUILIUM; LATENCY COST EQUATIONS; NASH EQUILIBRIA; SELFISH ROUTING;

CHANNEL CAPACITY; COST EFFECTIVENESS; PROBABILITY DISTRIBUTIONS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; USER INTERFACES;

NETWORK ROUTING;

EID: 34547371465     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0056-1     Document Type: Article

References (25)

1. D. Angluin and L. G. Valiant, Fast Probabilistic Algorithms for Hamiltonian Circuits and Matchings, Journal of Computer and System Sciences, Vol. 18, No. 2, pp. 155-193, April 1979.
2. H. Chernoff, A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations, Annals of Mathematical Statistics, Vol. 23, No. 4, pp. 493-509, December 1952.
3. A. Czumaj and B. Vöcking, Tight Bounds for Worst-Case Equilibria, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 413-420, January 2002.
4. R. Elsässer, M. Gairing, T. Lücking, M. Mavronicolas and B. Monien, A Simple Graph-Theoretic Model for Selfish Restricted Scheduling, Proceedings of the 1st International Workshop on Internet and Network Economics, Hong Kong, X. Deng and Y. Ye, eds., pp. 195-209, Vol. 3828 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, December, 2005.
5. R. Feldmann, M. Gairing, T. Lücking, B. Monien and M. Rode, Nashification and the Coordination Ratio for a Selfish Routing Game, Proceedings of the 30th International Colloquium on Automata, Languages and Programming, Eindhoven, The Netherlands, J. C. M. Baeten, J. K. Lenstra, J. Parrow and G. J. Woeginger, eds., pp. 514-526, Vol. 2719 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, June/July 2003.
6. S. Fischer and B. Vöcking, On the Structure and Complexity of Worst-Case Equilibria, Proceedings of the 1st International Workshop on Internet and Network Economics, Hong Kong, X. Deng and Y. Ye, eds., pp. 151-160, Vol. 3828 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, December, 2005.
7. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas and P. Spirakis, The Structure and Complexity of Nash Equilibria for a Selfish Routing Game, Proceedings of the 29th International Colloquium on Automata, Languages and Programming, Málaga, Spain, P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz and R. Conejo, eds., pp. 123-134, Vol. 2380 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, July 2002.
8. M. Gairing, T. Lücking, M. Mavronicolas and B. Monien, The Price of Anarchy for Polynomial Social Cost, Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, Prague, Czech Republic, J. Fiala, V. Koubek and J. Kratochvíl eds., pp. 574-585, Vol. 3153 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, August 2004. Extended version accepted by Theoretical Computer Science.
9. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien and M. Rode, Nash Equilibria in Discrete Routing Games with Convex Latency Functions, Proceedings of the 31st International Colloquium on Automata, Languages and Programming, J. Diaz, J. Karhumäki, A. Lepistö and D. Sannella, eds., pp. 645-657, Vol. 3142 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, July 2004.
10. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien and P. Spirakis, Extreme Nash Equilibria, Proceedings of the 8th Italian Conference on Theoretical Computer Science, C. Blundo and C. Laneve, eds., pp. 1-20, Vol. 2841 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, October 2003.
11. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien and P. Spirakis, Structure and Complexity of Extreme Nash Equilibria, Theoretical Computer Science (Special Issue Game Theory Meets Theoretical Computer Science, M. Mavronicolas and S. Abramsky, guest eds.), Vol. 343, Nos. 1-2, pp. 133-157, October 2005.
12. M. Gairing, T. Lücking, B. Monien and K. Tiemann, Nash Equilibria, the Rice of Anarchy and the Fully Mixed Nash Equilibrium Conjecture, Proceedings of the 32nd. International Colloquium on Automata, Languages and Programming (ICALP 2005), Lisboa, Portugal, L. Caires, G. F. Italiano, L. Monteiro, C. Palamidessi and M. Yung, eds., pp. 51-65, Vol. 3580 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, July 2005.
13. G. R. Grimmett and D. R. Stirzaker, Probability and Random Processes, second edition, Oxford Science Publications, Oxford, 1992.
14. V. F. Kolchin, V. P. Chistiakov and B. A. Sevastianov, Random Allocations, Winston, New York, 1978.
15. E. Koutsoupias, M. Mavronicolas and P. Spirakis, Approximate Equilibria and Ball Fusion, Theory of Computing Systems, Vol. 36, No. 6, pp. 683-693, November 2003.
16. E. Koutsoupias and C. H. Papadimitriou, Worst-Case Equilibria, Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science, Trier, Germany, G. Meinel and S. Tison eds., pp. 404-413, Vol. 1563 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, March 1999.
17. T. Lucking, M. Mavronicolas, B. Monien and M. Rode, A New Model for Selfish Routing, Proceedings of the 21st International Symposium on Theoretical Aspects of Computer Science, V. Diekert and M. Habib eds., pp. 547-558, Vol. 2996 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, March 2004. Extended version accepted by Theoretical Computer Science.
18. T. Lücking, M. Mavronicolas, B. Monien, M. Rode, P. Spirakis and I. Vrto, Which Is the Worst-Case Nash equilibrium?, Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, Bratislava, Slovak Republic, B. Rovan and P. Vojtas, eds., pp. 551-561, Vol. 2747 of Lecture Notes in Computer Science, Springer-Verlag, Berlin, August 2003.
19. M. Mavronicolas, P. Panagopoulou and P. Spirakis, A Cost Mechanism for Fair Pricing of Resource Usage, Proceedings of the 1st Workshop on Internet and Network Economics, Hong Kong, December 2005. Lecture Notes in Computer Science, Springer-Verlag, to appear.
20. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
21. J. F. Nash, Equilibrium Points in N -Person Games, Proceedings of the National Academy of Sciences, Vol. 36, pp. 48-49, 1950.
22. J. F. Nash, Non-Cooperative Games, Annals of Mathematics, Vol. 54, No. 2, pp. 286-295, 1951.
23. C. H. Papadimitriou, Algorithms, Games and the Internet, Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 749-753, July 2001.
24. T. Roughgarden and E. Tardos, How Bad Is Selfish Routing?, Journal of the ACM, Vol. 49, No. 2, pp. 236-259, March 2002.
25. J. G. Wardrop, Some Theoretical Aspects of Road Traffic Research, Proceedings of the Institute of Civil Engineers, Pt. II, Vol. 1, pp. 325-378, 1952.