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

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

Volumn 5385 LNCS, Issue , 2008, Pages 82-93

  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

Complexity; Extreme equilibria; Makespan objective; Network congestion game; Unsplittable flow

Indexed keywords

ELECTRIC NETWORK TOPOLOGY; INTERNET; PARALLEL ALGORITHMS; TELECOMMUNICATION NETWORKS; THREE TERM CONTROL SYSTEMS; WINE;

COMPLEXITY; EXTREME EQUILIBRIA; MAKESPAN OBJECTIVE; NETWORK CONGESTION GAME; UNSPLITTABLE FLOW;

GAME THEORY;

EID: 58849161802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-92185-1_17     Document Type: Conference Paper

References (12)

1. Pigou, A.C.: The economics of welfare. Macmillan, Basingstoke (1920)
2. Papadimitriou, C: Algorithms, games, and the internet. In: Proceedings of the 33rd Annual ACM Symposium on the Theory of Computing, pp. 749-753 (2001)
3. Koutsoupias, E., Papadimitriou, C: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404-413. Springer, Heidelberg (1999)
4. Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of nash equilibria for a selfish routing game. In: Wid-mayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123-134. Springer, Heidelberg (2002)
5. Gairing, M., Lücking, T., Mavronicolas, M., Monien, B., Spirakis, P.: The structure and complexity of extreme nash equilibria. Theoretical Computer Science 343(1-2), 133-157 (2005)
6. Fischer, S., Vöcking, B.: On the structure and complexity of worst-case equilibria. Theororetical Computer Science 378(2), 165-174 (2007)
7. Epstein, A., Feldman, M., Mansour, Y.: Efficient graph topologies in network routing games. In: Joint Workshop on Economics of Networked Systems and Incentive- Based Computing (2007)
8. Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. International Journal of Game Theory 2(1), 65-67 (1973)
9. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on the Theory of Computing, pp. 604-612 (2004)
10. Fotakis, D., Kontogiannis, S., Spirakis, P.: Symmetry in network congestion games: Pure equilibria and anarchy cost. In: Erlebach, T., Persinao, G. (eds.) WAOA 2005. LNCS, vol. 3879, pp. 161-175. Springer, Heidelberg (2005)
11. Garey, M.R., Johnson, D.S.: Computers and intractability. A guide to the theory of NP-completeness. A Series of Books in the Mathematical Sciences. W. H. Freeman & Co., New York (1979)
12. Bein, W.W., Brucker, P., Tamir, A.: Minimum cost flow algorithm for series-parallel networks. Discrete Applied Mathematics 10, 117-124 (1985)