Browsing by Subject "NP-completeness"
Now showing items 1-1 of 1
-
Article
The complexity of pure equilibria in mix-weighted congestion games on parallel links
(2015)We revisit the simple class of weighted congestion games on parallel links [10], where each player has a non-negative weight and her cost on the link she chooses is the sum of the weights of all players choosing the link. ...