Browsing by Subject "Latency function"
Now showing items 1-2 of 2
(2004)We study Nash equilibria in a discrete routing game that combines features of the two most famous models for non-cooperative routing, the KP model  and the Wardrop model . In our model, users share parallel links. ...
(2008)In a discrete routing game, each of n selfish users employs a mixed strategy to ship her (unsplittable) traffic over m parallel links. The (expected) latency on a link is determined by an arbitrary non-decreasing, non-constant ...