Pure Nash equilibria in player-specific and weighted congestion games

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

Volumn 4286 LNCS, Issue , 2006, Pages 50-61

  Ackermann, Heiner ^a   Röglin, Heiko ^a   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CARDINALITIES; CONGESTION GAMES; DELAY FUNCTION; MATROIDS; POLYNOMIAL-TIME ALGORITHMS; PURE NASH EQUILIBRIUM; STRATEGY SPACE;

COMPUTATION THEORY; INTERNET; POLYNOMIAL APPROXIMATION; WINE;

GAME THEORY;

EID: 57849135902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944874_6     Document Type: Conference Paper

References (13)

1. Heiner Ackermann, Heiko Röglin, and Berthold Vöcking. On the impact of combinatorial structure on congestion games. In Proc. 47th Ann. IEEE Symp. on Foundations of Computer Science (FOCS), 2006, (to appear).
2. Eyal Even-Dar, Alexander Kesselman, and Yishay Mansour. Convergence time to nash equilibria. In Proc. 30th Int. EATCS Coll. on Automata, Languages and Programming (ICALP), pages 502-513, 2003.
3. Alex Fabrikant, Christos Papadimitriou, and Kunal Talwar. The complexity of pure Nash equilibria. In Proc. 36th Ann. ACM Symp. on Theory of Comput. (STOC), pages 604-612, 2004.
4. Dimitris Fotakis, Spyros C. Kontogiannis, and Paul G. Spirakis. Selfish unsplittable flows. Theor. Comput. Sci., 348(2-3):226-239, 2005.
5. Martin Gairing, Thomas Lücking, Marios Mavronicolas, and Burkhard Monien. Computing nash equilibria for scheduling on restricted parallel links. In Proc. 36th Ann. ACM Symp. on Theory of Comput. (STOC), pages 613-622, 2004.
6. Martin Gairing, Burkhard Monien, and Karsten Tiemann. Routing (un-)splittable flow in games with player-specific linear latency functions. In Proc. 33rd Int. EATCS Coll. on Automata, Languages and Programming (ICALP), 2006. to appear.
7. Chryssis Georgiou, Theophanis Pavlides, and Anna Philippou. Uncertainty in selfish routing. In Proc. 20th IEEE International Parallel and Distributed Processing Symposium (IPDPS), 2006.
8. Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni, and Marina Thottan. Market sharing games applied to content distribution in ad-hoc networks. In MobiHoc, pages 55-66, 2004.
9. Samuel Ieong, Robert McGrew, Eugene Nudelman, Yoav Shoham, and Qixiang Sun. Fast and compact: A simple class of congestion games. In 20th National Conference on Artificial Intelligence (AAAI), 2005.
10. Igal Milchtaich. Congestion games with player-specific payoff functions. Games and Economic Behavior, 13(1):111-124, 1996.
11. Robert W. Rosenthal. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2:65-67, 1973.
12. Alexander Schrijver. Combinatorial Optimization: Polyhedra and Efficiency. Volume B, Matroids, Trees, Stable Sets, Chapters 39-69. Springer, 2003.
13. Renato Werneck, João Setubal, and Arlindo da Conceicão. Finding minimum congestion spanning trees. J. Exp. Algorithmics, 5:11, 2000.