Computing pure nash and strong equilibria in bottleneck congestion games

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

Volumn 6347 LNCS, Issue PART 2, 2010, Pages 29-38

  Harks, Tobias ^a   Hoefer, Martin ^b   Klimm, Max ^a   Skopalik, Alexander ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTLENECK CONGESTION; CENTRALIZED ALGORITHMS; HARDNESS RESULT; LOWER BOUNDS; MATROIDS; NASH EQUILIBRIUM; POLYNOMIAL-TIME; PURE NASH EQUILIBRIUM; REAL-WORLD NETWORKS; RUNNING TIME; STRONGLY NP-HARD; UNILATERAL IMPROVEMENTS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

TRAFFIC CONGESTION;

EID: 78349234322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15781-3_3     Document Type: Conference Paper

References (23)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 1-22 (2008)
2. Ackermann, H., Röglin, H., Vöcking, B.: Pure Nash equilibria in player-specific and weighted congestion games. Theor. Comput. Sci. 410(17), 1552-1562 (2009)
3. Aumann, R.: Acceptable points in general cooperative n-person games. In: Contributions to the Theory of Games, vol. 4 (1959)
4. Banner, R., Orda, A.: Bottleneck routing games in communication networks. IEEE J. Selected Areas Comm. 25(6), 1173-1179 (2007)
5. Chien, S., Sinclair, A.: Convergence to approximate Nash equilibria in congestion games. In: Proc. 18th Symp. Disc. Algorithms (SODA), pp. 169-178 (2007)
6. Cole, R., Dodis, Y., Roughgarden, T.: Bottleneck links, variable demand, and the tragedy of the commons. In: Proc. 17th Symp. Disc. Algorithms (SODA), pp. 668-677 (2006)
7. Cunningham, W.H.: Improved bounds for matroid partition and intersection algorithms. SIAM J. Comput. (15), 948-957 (1986)
8. Edmonds, J.: Matroid partition. In: Dantzig, G.B., Veinott, A.F. (eds.) Mathematics of the Decision Sciences, pp. 335-345 (1968)
9. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. 36th Symp. Theory of Computing (STOC), pp. 604-612 (2004)
10. Fortune, S., Hopcroft, J.E., Wyllie, J.C.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10, 111-121 (1980)
11. Gabow, H.N.: A matroid approach to finding edge connectivity and packing arborescences. J. Comput. Syst. Sci. 50(2), 259-273 (1995)
12. Harks, T., Klimm, M., Möhring, R.H.: Strong Nash equilibria in games with the lexicographical improvement property. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 463-470. Springer, Heidelberg (2009)
13. Holzman, R., Law-Yone, N.: Strong equilibrium in congestion games. Games Econ. Behav. 21(1-2), 85-101 (1997)
14. Keshav, S.: An engineering approach to computer networking: ATM networks, the Internet, and the telephone network. Addison-Wesley, Reading (1997)
15. Konishi, H., Le Breton, M., Weber, S.: Equilibria in a model with partial rivalry. J. Econ. Theory 72(1), 225-237 (1997)
16. Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2002)
17. Mazalov, V., Monien, B., Schoppmann, F., Tiemann, K.: Wardrop equilibria and price of stability for bottleneck games with splittable traffic. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 331-342. Springer, Heidelberg (2006)
18. Nash-Williams, C.: An application of matroids to graph theory. In: Rosenstiehl, P. (ed.) Theory of Graphs; Proc. Intl. Symp. Rome 1966, pp. 263-265 (1967)
19. Qiu, L., Yang, Y.R., Zhang, Y., Shenker, S.: On selfish routing in internet-like environments. IEEE/ACM Trans. Netw. 14(4), 725-738 (2006)
20. Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Intl. J. Game Theory 2(1), 65-67 (1973)
21. Roughgarden, T.: Routing games. In: Nisan, N., Tardos, É., Roughgarden, T., Vazirani, V. (eds.) Algorithmic Game Theory, ch. 18, Cambridge University Press, Cambridge (2007)
22. Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)
23. Skopalik, A., Vöcking, B.: Inapproximability of pure Nash equilibria. In: Proc. 40th Symp. Theory of Computing (STOC), pp. 355-364 (2008)