The complexity of welfare maximization in congestion games

Networks

Volumn 59, Issue 2, 2012, Pages 252-260

  Meyers, Carol A ^a   Schulz, Andreas S ^b  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

computational complexity; congestion games; multicommodity flows; network optimization

Indexed keywords

ASSOCIATED COSTS; COMPLEXITY RESULTS; CONGESTION GAMES; MINIMUM COST; MULTICOMMODITY FLOWS; NETWORK OPTIMIZATION; NP-HARD; POLYNOMIAL-TIME;

COMPUTATIONAL COMPLEXITY; POLYNOMIAL APPROXIMATION;

PROBLEM SOLVING;

EID: 84857045340     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20439     Document Type: Article

References (25)

1. E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and, T. Roughgarden, " The price of stability for network design with fair cost allocation," Proc Forty-Fifth Symp Found Comput Sci, IEEE Computer Society, Rome, Italy, 2004, pp. 295-304 (Pubitemid 40575291)
2. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and, M. Protasi, Complexity and approximation: Combinatorial optimization problems and their approximability properties, Springer, Berlin, 1999.
3. R. Beier, A. Czumaj, P. Krysta, and, B. Vöcking, Computing equilibria for a service provider game with (im) perfect information, ACM Trans Algorithms 2 (2006), 679-706. (Pubitemid 46174066)
4. L. Blumrosen, and, S. Dobzinski, " Congestion games with malicious players," Proc Seventh ACM Conference Electronic Commerce, ACM Press, Ann Arbor, MI 2006, pp. 52-61.
5. D. Chakrabarty, A. Mehta, V. Nagarajan, and, V. Vazirani, " Fairness and optimality in congestion games," Proc Sixth ACM Conf Electron Commerce, ACM Press, Vancouver, BC 2005, pp. 52-57. (Pubitemid 43048664)
6. A. Czumaj, and, B. Vöcking, Tight bounds for worst-case equilibria, ACM Trans Algorithms 3 (2007), 5:1-5:17.
7. J. Dunkel, and, A. S Schulz, On the complexity of pure-strategy Nash equilibria in congestion and localeffect games, Math Oper Res 33 (2008), 851-868.
8. R. Erickson, C Monma, and, A. Veinott, Jr., Send-and-split method for minimum-concave-cost network flows, Math Oper Res 12 (1987), 634-664. (Pubitemid 18530619)
9. A. Fabrikant, C. Papadimitriou, and, K. Talwar, " The complexity of pure Nash equilibria," Proc Thirty-Sixth Annu ACM Symp Theory Comput, ACM Press, Chicago, IL 2004, pp. 604-612.
10. S. Fortune, J. Hopcroft, and, J. Wyllie, The directed subgraph homeomorphism problem, Theor Comput Sci 10 (1980), 111-121.
11. D. Fotakis, S. Kontogiannis, and, P. Spirakis, Selfish unsplittable flows, Theor Comput Sci 348 (2005), 226-239.
12. D. Fotakis, S. Kontogiannis, and, P. Spirakis, " Symmetry in network congestion games: Pure equilibria and anarchy cost," Proc Third Workshop Approximation Online Algorithms, Number 3879 in Lecture Notes in Computer Science, Springer, Mallorca, Spain 2005, pp. 161-175.
13. M. Garey, and, D. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, New York, 1979.
14. S. Ieong, R. McGrew, E. Nudelman, Y. Shoham, and, Q. Sun, " Fast and compact: A simple class of congestion games," Proc Twentieth Natl Conf Art Intel, AAAI Press, Pittsburgh, PA, 2005, pp. 489-494. (Pubitemid 43006658)
15. R. Johari, and, J. Tsitsiklis, Efficiency loss in a network resource allocation game, Math Oper Res 29 (2004), 407-435.
16. S. Kontogiannis, and, P. Spirakis, " Atomic selfish routing in networks: a survey," Proc First Int Workshop Int Network Economics, Number 3828 in Lecture Notes in Computer Science, Springer, Hong Kong, China 2005, pp. 989-1002. (Pubitemid 43849337)
17. E. Koutsoupias, and, C. Papadimitriou, " Worst-case equilibria," Proc Sixteenth Annu ACM Symp Theor Comput, Springer, Trier, Germany 1999, pp. 404-413.
18. M. Mavronicolas, and, P. Spirakis, The price of selfish routing, Algorithmica 48 (2007), 91-126. (Pubitemid 47136630)
19. I. Milchtaich, Congestion games with player-specific payoff functions, Games Econ Behavior 13 (1996), 111-124. (Pubitemid 126162007)
20. I. Milchtaich, Generic uniqueness of equilibrium in large crowding games, Math Oper Res 25 (2000), 349-364.
21. I. Milchtaich, " The equilibrium existence problem in finite network congestion games," Proc Sec Int Workshop Int Network Econ, Number 4286 in Lecture Notes in Computer Science, Springer, Patras, Greece 2006, pp. 87-98.
22. C. Papadimitriou, " Computing correlated equilibria in multi-player games," Proc Thirty-Seventh Annu ACM Symp Theor Comput, ACM Press, Baltimore, MD 2005, pp. 49-56.
23. C. Papadimitriou, and, T. Roughgarden, " Computing equilibria in multi-player games," Proc Sixteenth Annu ACM-SIAM Symp Discrete Algorithms, Society for Industrial and Applied Mathematics, Vancouver, BC, 2005, pp. 82-91. (Pubitemid 40851360)
24. R. Rosenthal, A class of games possessing pure-strategy Nash equilibria, Int J Game Theory 2 (1973), 65-67.
25. S. Suri, C. Tõth, and, Y. Zhou, Selfish load balancing and atomic congestion games, Algorithmica 47 (2007), 79-96. (Pubitemid 46220349)