Weighted congestion games: The price of anarchy, universal worst-case examples, and tightness

ACM Transactions on Economics and Computation

Volumn 2, Issue 4, 2014, Pages

  Bhawalkar, Kshipra ^a   Gairing, Martin ^b   Roughgarden, Tim ^a  

^a STANFORD UNIVERSITY   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Algorithms; Economics; F.2.2 analysis of algorithms and problem complexity : nonnumerical algorithms and problems; Nash equilibria; Price of anarchy; Theory; Weighted congestion games

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; ECONOMICS;

CONGESTION GAMES; NASH EQUILIBRIA; PRICE OF ANARCHY; PROBLEM COMPLEXITY; THEORY;

COST FUNCTIONS;

EID: 84929202071     PISSN: 21678375     EISSN: 21678383     Source Type: Journal    
DOI: 10.1145/2629666     Document Type: Article

References (25)

1. S. Aland, D. Dumrauf, M. Gairing, B. Monien, and F. Schoppmann. 2011. Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40, 5, 1211-1233.
2. E. Anshelevich, A. Dasgupta, J. Kleinberg, É. Tardos, T. Wexler, and T. Roughgarden. 2008. The price of stability for network design with fair cost allocation. SIAM J. Comput. 38, 4, 1602-1623.
3. B. Awerbuch, Y. Azar, and L. Epstein. 2005. The price of routing unsplittable flow. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC). 57-66.
4. A. Blum, E. Even-Dar, and K. Ligett. 2010. Routing without regret: On convergence to Nash equilibria of regret-minimizing algorithms in routing games. Theory Comput. 6, 179-199.
5. I. Caragiannis, M. Flammini, C. Kaklamanis, P. Kanellopoulos, and L. Moscardelli. 2011. Tight bounds for selfish and greedy load balancing. Algorithmica 61, 3, 606-637.
6. G. Christodoulou and E. Koutsoupias. 2005a. On the price of anarchy and stability of correlated equilibria of linear congestion games. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA). 59-70.
7. G. Christodoulou and E. Koutsoupias. 2005b. The price of anarchy of finite congestion games. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC). 67-73.
8. J. R. Correa, A. S. Schulz, and N. E. Stier Moses. 2004. Selfish routing in capacitated networks. Math. Oper. Res. 29, 4, 961-976.
9. D. Fotakis. 2010. Congestion games with linearly independent paths: Convergence time and price of anarchy. Theory Comput. Syst. 47, 1, 113-136.
10. D. Fotakis, S. C. Kontogiannis, and P. G. Spirakis. 2008. Atomic congestion games among coalitions. ACM Trans. Algor. 4, 4.
11. M. Gairing and F. Schoppmann. 2007. Total latency in singleton congestion games. In Proceedings of the 3rd International Workshop on Internet and Network Economics (WINE). 381-387.
12. T. Harks and M. Klimm. 2012. On the existence of pure Nash equilibria in weighted congestion games. Math. Oper. Res. 37, 3, 419-436.
13. T. Harks, M. Klimm, and R. H. Möhring. 2011. Characterizing the existence of potential functions in weighted congestion games. Theory Comput. Syst. 49, 1, 46-70.
14. A. Hayrapetyan, É. Tardos, and T. Wexler. 2006. The effect of collusion in congestion games. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC). 89-98.
15. R. Holzman and N. Law-Yone. 2003. Network structure and strong equilibrium in route selection games. Math. Social Sci. 46, 193-205.
16. E. Koutsoupias and C. H. Papadimitriou. 1999. Worst-case equilibria. In Proceedings of the 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS). 404-413.
17. T. Lücking, M. Mavronicolas, B. Monien, and M. Rode. 2008. A new model for selfish routing. Theoret. Comput. Sci. 406, 3, 187-206.
18. I. Milchtaich. 1996. Congestion games with player-specific payoff functions. Games Econom. Behav. 13, 1, 111-124.
19. R. W. Rosenthal. 1973. A class of games possessing pure-strategy Nash equilibria. Int. J. Game Theory 2, 1, 65-67.
20. T. Roughgarden. 2003. The price of anarchy is independent of the network topology. J. Comput. Syst. Sci. 67, 2, 341-364.
21. T. Roughgarden. 2006. Potential functions and the inefficiency of equilibria. In Proceedings of the ICM, Vol. III. 1071-1094.
22. T. Roughgarden. 2009. Intrinsic robustness of the price of anarchy. In Proceedings of the 41st ACM Symposium on Theory of Computing (STOC). 513-522.
23. T. Roughgarden. 2012. The price of anarchy in games of incomplete information. In Proceedings of the 13th ACM Conference on Electronic Commerce (EC). 862-879.
24. T. Roughgarden and É. Tardos. 2004. Bounding the inefficiency of equilibria in nonatomic congestion games. Games Econom. Behav. 49, 2, 389-403.
25. L. S. Shapley. 1953. Additive and non-additive set functions. Ph.D. Dissertation, Department of Mathematics, Princeton University.