Exact price of anarchy for polynomial congestion games

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

Volumn 3884 LNCS, Issue , 2006, Pages 218-229

  Aland, Sebastian ^a   Dumrauf, Dominic ^a   Gairing, Martin ^a   Monien, Burkhard ^a   Schoppmann, Florian ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); FUNCTION EVALUATION; FUNCTIONS; POLYNOMIALS; TELECOMMUNICATION NETWORKS;

NETWORK CONGESTION GAMES; POLYNOMIAL LATENCY FUNCTIONS; UNWEIGHTED CONGESTION GAMES;

GAME THEORY;

EID: 33745598504     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11672142_17     Document Type: Conference Paper

References (30)

1. B. Awerbuch, Y. Azar, and A. Epstein. The Price of Routing Unsplittable Flow. In Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC'05), pages 57-66, 2005.
2. B. Awerbuch, Y. Azar, Y Richter, and D. Tsur. Tradeoffs in Worst-Case Equilibria. Proc. of the 1st Int. Workshop on Approximation and Online Algorithms (WAOA '03), LNCS 2909, pages 41-52, 2003.
3. M Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics of Transportation. Yale University Press, 1956.
4. G. Christodoulou and E. Koutsoupias. On The Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games. In Proc. of the 13th Annual European Symposium on Algorithms (ESA'05), LNCS 3669, pages 59-70, 2005.
5. G. Christodoulou and E. Koutsoupias. The Price of Anarchy of Finite Congestion Games. In Proc. of the 37th Annual ACM Symposium on Theory of Computing (STOC'05), pages 67-73, 2005.
6. A. Czumaj, P. Krysta, and B. Vöcking. Selfish Traffic Allocation for Server Farms. In Proc. of the 34th Annual ACM Symposium on Theory of Computing (STOC'02), pages 287-296, 2002.
7. A. Czumaj and B. Vöcking. Tight Bounds for Worst-Case Equilibria. In Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'02), pages 413-420, 2002.
8. Also accepted to Journal of Algorithms as Special Issue of SODA'02.
9. D. Fotakis, S. Kontogiannis, and P. Spirakis. Selfish Unsplittable Flows. Proc. of the 31st Int. Colloquium on Automata, Languages, and Programming (ICALP'04), LNCS 3142, pages 593-605, 2004.
10. D. Fotakis, S. Kontogiannis, and P. Spirakis. Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost. In Proc. of the 3rd Int. Workshop on Approximation and Online Algorithms (WAOA'05), 2005.
11. M. Gairing, T. Lucking, M. Mavronicolas, and B. Monien. Computing Nash Equilibria for Scheduling on Restricted Parallel Links. In Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC'04), pages 613-622, 2004.
12. M. Gairing, T. Lucking, M. Mavronicolas, and B. Monien. The Price of Anarchy for Polynomial Social Cost. Proc. of the 29th Int. Symposium on Mathematical Foundations of Computer Science (MFCS'04), LNCS 3153, pages 574-585, 2004.
13. M. Gairing, T. Lucking, M. Mavronicolas, B. Monien, and M. Rode. Nash Equilibria in Discrete Routing Games with Convex Latency Functions. Proc. of the 31st Int. Colloquium on Automata, Languages, and Programming (ICALP'04), LNCS 3142, pages 645-657, 2004.
14. M. Gairing, T. Lücking, B. Monien, and K. Tiemann. Nash Equilibria, the Price of Anarchy and the Fully Mixed Nash Equilibrium Conjecture. In Proc. of the 32nd Int. Colloquium on Automata, Languages, and Programming (ICALP'05), LNCS 3850, pages 51-65, 2005.
15. M. Gairing, B. Monien, and K. Tiemann. Selfish Routing with Incomplete Information. In Proc. of the 17th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'05), pages 203-212, 2005.
16. E. Koutsoupias, M. Mavronicolas, and P. Spirakis. Approximate Equilibria and Ball Fusion. Theory of Computing Systems, 36(6):683-693, 2003.
17. E. Koutsoupias and C. H. Papadimitriou. Worst-Case Equilibria, Proc. of the 16th Int. Symposium on Theoretical Aspects of Computer Science (STACS'99), LNCS 1563, pages 404-413, 1999.
18. T. Lücking, M. Mavronicolas, B. Monien, and M. Rode. A New Model for Selfish Routing. Proc. of the 21st Int. Symposium on Theoretical Aspects of Computer Science (STACS'04), LNCS 2996, pages 547-558, 2004.
19. A. Mas-Colell, M. D. Whinston, and J. R. Green, Microeconomic Theory. Oxford University Press, 1995.
20. R. D. McKelvey and A. McLennan. Computation of Equilibria in Finite Games. Handbook of Computational Economics, 1996.
21. I. Milchtaich. Congestion Games with Player-Specific Payoff Functions, Games and Economic Behavior, 13(1):111-124, 1996.
22. D. Monderer and L. S. Shapley. Potential Games. Games and Economic Behavior, 14(1):124-143, 1996.
23. J. F. Nash. Equilibrium Points in n-Person Games. Proc. of the National Academy of Sciences of the United States of America, 36:48-49, 1950.
24. J. F. Nash. Non-Cooperative Games. Annals of Mathematics, 54(2):286-295, 1951.
25. C. H. Papadimitriou. Algorithms, Games, and the Internet. In Proc. of the 33rd Annual ACM Symposium on Theory of Computing (STOC'01), pages 749-753, 2001.
26. R. W. Rosenthal. A Class of Games Possessing Pure-Strategy Nash Equilibria. Int. Journal of Game Theory, 2:65-67, 1973.
27. T. Roughgarden. How Unfair is Optimal Routing. In Proc. of the l3th Annual ACM-SlAM Symposium on Discrete Algorithms (SODA'02), pages 203-204, 2002.
28. T. Roughgarden. Selfish Routing and the Price of Anarchy. MIT Press, 2005.
29. T. Roughgarden and E. Tardos. How Bad Is Selfish Routing? Journal of the ACM, 49(2):236-259, 2002.
30. J. G. Wardrop. Some Theoretical Aspects of Road Traffic Research. In Proc. of the Institute of Civil Engineers, Pt. II, Vol. 1, pages 325-378, 1952.