Pure Nash equilibria in player-specific and weighted congestion games

Theoretical Computer Science

Volumn 410, Issue 17, 2009, Pages 1552-1563

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Congestion games; Matroids; Nash equilibria

Indexed keywords

CONTROL THEORY; DYNAMICS; GRAPH THEORY; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION NETWORKS;

BEST RESPONSE; CARDINALITY; CONGESTION GAMES; CONVERGENCE TIME; DELAY FUNCTIONS; LOWER BOUNDS; MATROID; MATROIDS; NASH EQUILIBRIA; POLYNOMIAL-TIME ALGORITHMS; PURE NASH EQUILIBRIUM; SHORT SEQUENCES; STRATEGY SPACES;

GAME THEORY;

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

References (21)

1. Heiner Ackermann, Heiko Röglin, Berthold Vöcking, On the impact of combinatorial structure on congestion games, in: Proceedings of the 47th Ann. IEEE Symp. on Foundations of Computer Science, FOCS, 2006, pp. 613-622
2. Heiner Ackermann, Alexander Skopalik, On the complexity of pure nash equilibria in player-specific network congestion games, in: Proceedings of the 3rd International Workshop on Internet and Network Economics, WINE, 2007, pp. 419-430
3. Elliot Anshelevich, Anirban Dasgupta, Jon Kleinberg, Eva Tardos, Tom Wexler, Tim Roughgarden, The price of stability for network design with fair cost allocation, in: Proceedings of the 45th Ann. IEEE Symp. on Foundations of Computer Science, FOCS, 2004, pp. 295-304
4. Juliane Dunkel, Andreas S. Schulz, On the complexity of pure-strategy Nash equilibria in congestion and local-effect games, in: Proc. of the 2nd Int. Workshop on Internet and Network Economics, WINE, 2006, pp. 62-73
5. Eyal Even-Dar, Alexander Kesselman, Yishay Mansour, Convergence time to Nash equilibria, in: Proceedings of the 30th Int. Coll. on Automata, Languages and Programming, ICALP, 2003, pp. 502-513
6. Alex Fabrikant, Christos Papadimitriou, Kunal Talwar, The complexity of pure Nash equilibria, in: Proceedings of the 36th Ann. ACM Symp. on Theory of Computing, STOC, 2004, pp. 604-612
7. Dimitris Fotakis, Spyros C. Kontogiannis, Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis, The structure and complexity of Nash equilibria for a selfish routing game, in: Proceedings of the 29th Int. Coll. on Automata, Languages and Programming, ICALP, 2002, pp. 123-134
8. Fotakis D., Kontogiannis S.C., and Spirakis P.G. Selfish unsplittable flows. Theoretical Computer Science 348 2-3 (2005) 226-239
9. Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Computing Nash equilibria for scheduling on restricted parallel links, in: Proceedings of the 36th Ann. ACM Symp. on Theory of Computing, STOC, 2004, pp. 613-622
10. Martin Gairing, Burkhard Monien, Karsten Tiemann, Routing (un-)splittable flow in games with player-specific linear latency functions, in: Proceedings of the 33rd Int. Coll. on Automata, Languages and Programming, ICALP, 2006, pp. 501-512
11. Chryssis Georgiou, Theophanis Pavlides, Anna Philippou, Uncertainty in selfish routing, in: Proc. of the 20th IEEE Int. Parallel and Distributed Processing Symp., IPDPS, 2006
12. Michel X. Goemans, Erran L. Li, Vahab S. Mirrokni, Marina Thottan, Market sharing games applied to content distribution in ad-hoc networks, in: Proc. of the 5th ACM Int. Symp. on Mobile Ad Hoc Networking and Computing, MobiHoc, 2004, pp. 55-66
13. Armin Haken, Connectionist networks that need exponential time to stabilize, Department of Computer Science, University of Toronto, 1989, Unpublished manuscript
14. Samuel Ieong, Robert McGrew, Eugene Nudelman, Yoav Shoham, Qixiang Sun, Fast and compact: A simple class of congestion games, in: Proc. of the 20th Nat. Conference on Artificial Intelligence, AAAI, 2005, pp. 489-494
15. Johnson D.S., Papadimitriou C.H., and Yannakakis M. How easy is local search?. Journal of Computer and System Sciences 37 1 (1988) 79-100
16. Milchtaich I. Congestion games with player-specific payoff functions. Games and Economic Behavior 13 1 (1996) 111-124
17. Igal Milchtaich, The equilibrium existence problem in finite network congestion games, in: Proc. of the 2nd Int. Workshop on Internet and Network Economics, WINE, 2006, pp. 87-98
18. Orponen P. Computing with truly asynchronous threshold logic networks. Theoretical Computer Science 174 1-2 (1997) 123-136
19. Rosenthal R.W. A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory 2 (1973) 65-67
20. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency. Matroids, Trees, Stable Sets vol. B (2003), Springer (Chapters 39-69)
21. Werneck R., Setubal J., and da Conceicão A. Finding minimum congestion spanning trees. Journal of Experimental Algorithmics 5 (2000)