Browsing by Subject "Polynomial-time algorithms"
Now showing items 1-2 of 2
-
Article
Computing Nash equilibria for scheduling on restricted parallel links
(2010)We consider the problem of routing nusers on m parallel links under the restriction that each user may only be routed on a link from a certain set of allowed links for the user. So, this problem is equivalent to the ...
-
Article
Selfish routing in the presence of network uncertainty
(2009)We study the problem of selfish routing in the presence of incomplete network information. Our model consists of a number of users who wish to route their traffic on a network of m parallel links with the objective of ...