The price of anarchy for polynomial social cost

Theoretical Computer Science

Volumn 369, Issue 1-3, 2006, Pages 116-135

  Gairing, Martin ^a   Lücking, Thomas ^a   Mavronicolas, Marios ^b   Monien, Burkhard ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Polynomial price of anarchy; Price of anarchy; Selfish routing

Indexed keywords

COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

POLYNOMIAL PRICE OF ANARCHY; PRICE OF ANARCHY; SELFISH ROUTING;

POLYNOMIALS;

EID: 33750989087     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2006.07.055     Document Type: Article

References (29)

1. S. Aland, D. Dumrauf, M. Gairing, B. Monien, F. Schoppmann, Exact price of anarchy for polynomial congestion games, in: B. Duran, W. Thomas (Eds.), Proc. 23rd Internat. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 3884, Springer, Berlin, February 2006, pp. 218-229.
2. Altman E., Basar T., Jiménez T., and Shimkin N. Competitive routing in networks with polynomial costs. IEEE Trans. Automat. Control 47 1 (2002) 92-96
3. Aumann R.J. Subjectivity and correlation in randomized strategies. J. Math. Econom. 1 (1974) 67-95
4. Awerbuch B., Azar Y., and Epstein A. The price of routing unsplittable flow. Proc. 37th Annu. ACM Symp. on Theory of Computing (May 2005) 57-66
5. Bell E.T. Exponential polynomials. Ann. of Math. 35 (1934) 258-277
6. Boyce D.E., Janson B.N., and Eash R.W. The effect on equilibrium trip assignment of different congestion functions. Transport Res. A 15 (1981) 223-232
7. Christodoulou G., and Koutsoupias E. The price of anarchy of finite congestion games. Proc. 37th Annu. ACM Symp. on Theory of Computing (May 2005) 67-73
8. G. Christodoulou, E. Koutsoupias, On the price of anarchy and stability of correlated equilibria of linear congestion games, in: G. Brodal, S. Leonardi (Eds.), Proc. 13th Annu. European Symp. on Algorithms, Lecture Notes in Computer Science, Vol. 3669, Springer, Berlin, October 2005, pp. 59-70.
9. Czumaj A., Krysta P., and Vöcking B. Selfish traffic allocation for server farms. Proc. 34th Annu. ACM Symp. on Theory of Computing (May 2002) 287-296
10. Czumaj A., and Vöcking B. Tight bounds for worst-case equilibria. Proc. 13th Annu. ACM-SIAM Symp. on Discrete Algorithms (January 2002) 413-420
11. R. Feldmann, M. Gairing, T. Lücking, B. Monien, M. Rode, Nashification and the coordination ratio for a selfish routing game, in: J.C.M. Baeten, J.K. Lenstra, J. Parrow, G.J. Woeginger (Eds.), Proc. 30th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2719, Springer, Berlin, June/July 2003, pp. 514-526.
12. S. Fischer, B. Vöcking, On the structure and complexity of worst-case equilibria, in: X. Deng, Y. Ye (Eds.), Proc. First Internat. Workshop on Internet and Network Economics, Lecture Notes in Computer Science, Vol. 3828, Springer, Berlin, December 2005, pp. 151-160.
13. D. Fotakis, S. Kontogiannis, E. Koutsoupias, M. Mavronicolas, P. Spirakis, The structure and complexity of Nash equilibria for a selfish routing game, in: P. Widmayer, F. Triguero, R. Morales, M. Hennessy, S. Eidenbenz, R. Conejo (Eds.), Proc. 29th Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 2380, Springer, Berlin, July 2002, pp. 123-134.
14. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, M. Rode, Nash equilibria in discrete routing games with convex latency functions, in: J. Diaz, J. Karhumäki, A. Lepistö, D. Sannella (Eds.), Proc. 31st Internat. Colloq. on Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 3142, Springer, Berlin, July 2004, pp. 645-657.
15. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, P. Spirakis, Extreme Nash equilibria, in: C. Blundo, C. Laneve (Eds.), Proc. Eighth Italian Conf. Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 2841, Springer, Berlin, October 2003, pp. 1-20.
16. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, P. Spirakis, Structure and complexity of extreme Nash equilibria, Theoret. Comput. Sci. (special issue), in: M. Mavronicolas, S. Abramsky (Guest Eds.), Game Theory Meets Theoretical Computer Science 343 (1-2) (2005) 133-157.
17. Graham R.L., Knuth D.E., and Patashnik O. Concrete Mathematics-A Foundation for Computer Science. second ed. (1994), Addison-Wesley, Reading, MA
18. Koutsoupias E., Mavronicolas M., and Spirakis P. Approximate equilibria and ball fusion. Theory of Comput. Systems 36 6 (2003) 683-693
19. E. Koutsoupias, C.H. Papadimitriou, Worst-case equilibria, in: G. Meinel, S. Tison (Eds.), Proc. 16th Internat. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, March 1999, pp. 404-413.
20. T. Lücking, M. Mavronicolas, B. Monien, M. Rode, A new model for selfish routing, in: V. Diekert, M. Habib (Eds.), Proc. 21st Internat. Symp. on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 2996, Springer, Berlin, March 2004, pp. 547-558.
21. T. Lücking, M. Mavronicolas, B. Monien, M. Rode, P. Spirakis, I. Vrto, Which is the worst-case Nash equilibrium?, in: B. Rovan, P. Vojtas (Eds.), Proc. 28th Internat. Symp. on Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, August 2003, pp. 551-561.
22. Mavronicolas M., and Spirakis P. The price of selfish routing. Proc. 33rd Annu. ACM Symp. on Theory of Computing (July 2001) 510-519
23. Nash J.F. Equilibrium points in N-person games. Proc. Nat. Acad. Sci. USA 36 (1950) 48-49
24. Nash J.F. Non-cooperative games. Ann. Math. 54 (1951) 286-295
25. Papadimitriou C.H. Algorithms, games and the Internet. Proc. 33rd Annu. ACM Symp. on Theory of Computing (July 2001) 749-753
26. Rosenthal R.W. A class of games possessing pure-strategy Nash equilibria. Internat. J. Game Theory 2 (1973) 65-67
27. Roughgarden T., and Tardos E. How bad is selfish routing?. J. ACM 49 2 (2002) 236-259
28. J. Stirling, Methodus Differentialis, London, 1730.
29. Wardrop J.G. Some theoretical aspects of road traffic research. Proc. Inst. of Civil Eng. Part II 1 (1956) 325-378