On the complexity of pure Nash equilibria in player-specific network congestion games

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

Volumn 4858 LNCS, Issue , 2007, Pages 419-430

  Ackermann, Heiner ^a   Skopalik, Alexander ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CONGESTION CONTROL (COMMUNICATION); DECISION THEORY; TELECOMMUNICATION NETWORKS;

NASH EQUILIBRIA; NETWORK CONGESTION GAMES; PLAYER-SPECIFIC DELAY FUNCTIONS;

GAME THEORY;

EID: 38449102290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77105-0_47     Document Type: Conference Paper

References (14)

1. Ackermann, H., Röglin, H., Vöcking, B.: On the impact of combinatorial structure on congestion games. In: Proc. of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 613-622 (2006)
2. Ackermann, H., Röglin, H., Vöcking, B.: Pure Nash equilibria in player-specific and weighted congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 50-61. Springer, Heidelberg (2006)
3. Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, E., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. In: Proc. of the 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 295-304 (2004)
4. Chakrabarty, D., Mehta, A., Nagarajan, V.: Fairness and optimality in congestion games. In: Proc. of the 6th ACM conference on Electronic Commerce (EC), pp. 52-57. ACM Press, New York (2005)
5. Dunkel, J., Schulz, A.S.: On the complexity of pure-strategy Nash equilibria in congestion and local-effect games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 62-73. Springer, Heidelberg (2006)
6. Fabrikant, A., Papadimitriou, C., Talwar, K.: The complexity of pure Nash equilibria. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 604-612 (2004)
7. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
8. Johnson, D.S., Papadimtriou, C.H., Yannakakis, M.: How easy is local search? Journal on Computer and System Sciences 37(1), 79-100 (1988)
9. Meyers, C.: Network Flow Problems and Congestion Games: Complexitiy and Approximation. Massachusetts Institute of Technology (2006)
10. Milchtaich, I.: Congestion games with player-specific payoff functions. Games and Economic Behavior 13(1), 111-124 (1996)
11. Milchtaich, I.: The equilibrium existence problem in finite network congestion games. In: Spirakis, P.G., Mavronicolas, M., Kontogiannis, S.C. (eds.) WINE 2006. LNCS, vol. 4286, pp. 87-98. Springer, Heidelberg (2006)
12. Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (forthcoming)
13. Rosenthal, R.W.: A class of games possessing pure-strategy Nash equilibria. Int. Journal of Game Theory 2, 65-67 (1973)
14. Schärfer, A.A., Yannakakis, M.: Simple local search problems that are hard to solve. SIAM Journal on Computing 20(1), 56-87 (1991)