The Complexity of Welfare Maximization in Congestion Games
We investigate issues of complexity related to welfare maximization in congestion games. In particular, we provide a full classification of complexity results for the problem of finding a minimum cost solution to a congestion game, under the model of Rosenthal. We consider both network and general c...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
John Wiley & Sons, Inc.
2013
|
| Online Access: | http://hdl.handle.net/1721.1/77914 https://orcid.org/0000-0002-9595-459X |
| Summary: | We investigate issues of complexity related to welfare maximization in congestion games. In particular, we provide a full classification of complexity results for the problem of finding a minimum cost solution to a congestion game, under the model of Rosenthal. We consider both network and general congestion games, and we examine several variants of the problem concerning the structure of the game and the properties of its associated cost functions. Many of these problem variants turn out to be NP-hard, and some are hard to approximate to within any finite factor, unless P = NP. We also identify several versions of the problem that are solvable in polynomial time. |
|---|