How hard is it to find extreme Nash equilibria in network congestion games?

Theoretical Computer Science

Volumn 410, Issue 47-49, 2009, Pages 4989-4999

  Gassner, Elisabeth ^a   Hatzl, Johannes ^a   Krumke, Sven O ^b   Sperber, Heike ^b   Woeginger, Gerhard J ^c  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b University of Koblenz Landau   (Germany)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

C72 non cooperative games ; Complexity; Extreme equilibria; Makespan objective; Network congestion game; Unsplittable flow

Indexed keywords

COMPLEX NETWORKS; GAME THEORY;

C72[NON-COOPERATIVE GAMES]; COMPLEXITY; EXTREME EQUILIBRIA; MAKESPAN OBJECTIVE; NETWORK CONGESTION GAME; UNSPLITTABLE FLOW;

ELECTRIC NETWORK TOPOLOGY;

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

References (20)

1. R.K. Ahuja, T.L. Magnanti, J.B. Oriin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 1993.
2. B. Awerbuch, Y. Azar, A. Epstein, The price of routing unsplittable flow, in: Proceedings 37th Annual ACM Symposium on the Theory of Computing, STOC, 2005.
3. W.W. Bein, P. Brucker, A. Tamir, Minimum cost flow algorithm for series-parallel networks, Discrete Applied Mathematics 10 (1985) 117-124.
4. G. Christodoulou, E. Koutsoupias, The price of anarchy of finite congestion games, in: Proceedings ofthe 37th Annual ACM Symposium on the Theory of Computing, STOC, ACM, 2005.
5. A. Czumaj, B. Vöcking, Tight bounds for worst-case equilibria, in: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2002.
6. A. Epstein, M. Feldman, Y. Mansour, Efficient graph topologies in network routing games, in: Joint Workshop on Economics of Networked Systems and Incentive-Based Computing, 2007.
7. A. Fabrikant, C. Papadimitriou, K. Talwar, The complexity of pure Nash equilibria, in: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, STOC, 2004.
8. 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.), Proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP, in: LNCS, vol. 2719, Springer, 2003.
9. S. Fischer, B. Vöcking, On the structure and complexity of worst-case equilibria, Theoretical Computer Science 378 (2) (2007) 165-174. (Pubitemid 46719677)
10. 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.T. Ruiz, R.M. Bueno, M. Hennessy, S. Eidenbenz, R. Conejo (Eds.), Proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP, in: LNCS, vol. 2380, Springer-Verlag, 2002.
11. D. Fotakis, S. Kontogiannis, P. Spirakis, Selfish unsplittable flows, Theoretical Computer Science 348 (2-3) (2005) 226-239.
12. D. Fotakis, S. Kontogiannis, P. Spirakis, Symmetry in network congestion games: Pure equilibria and anarchy cost, in: T. Erlebach, G. Persiano (Eds.), Proceedings of the 3rd Workshop on Approximation and Online Algorithms, WAOA, in: LNCS, vol. 3879, Springer, 2005.
13. M. Gairing, T. Lücking, M. Mavronicolas, B. Monien, P. Spirakis, The structure and complexity of extreme Nash equilibria, Theoretical ComputerScience 343(1-2)(2005)133-157. (Pubitemid 41360149)
14. M.R. Garey, D.S. Johnson, Computers and intractability. A guide to the theory of NP-completeness, in: A Series of Books in the Mathematical Sciences, W. H. Freeman & Co., 1979.
15. E. Gassner, J. Hatzl, S.O. Krumke, H. Sperber, G.J. Woeginger, How hard is it to find extreme Nash equilibria in network congestion games? in: C. Papadimitriou, S. Zhang (Eds.), Proceedings of the 4th International Workshop on Internet and Network Economics, WINE, in: LNCS, vol. 5385, 2008.
16. E. Koutsoupias, C. Papadimitriou, Worst-case equilibria, in: Proceedings of the 16th International Symposium on Theoretical Aspects of Computer Science, STACS, in: LNCS, vol. 1563,1999.
17. M. Mavronicolas, P. Spirakis, The price of selfish routing, in: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, STOC, 2001.
18. C. Papadimitriou, Algorithms, games, and the internet, in: Proceedings ofthe 33rd Annual ACM Symposium on the Theory of Computing, STOC, 2001.
19. A.C. Pigou, The Economics of Welfare, Macmillan, 1920.
20. R.W. Rosenthal, A class of games possessing pure-strategy Nash equilibria, International Journal of Game Theory 2 (1) (1973) 65-67.