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 |