Browsing by Subject "Parallel links"
Now showing items 110 of 10

Article
The complexity of pure equilibria in mixweighted congestion games on parallel links
(2015)We revisit the simple class of weighted congestion games on parallel links [10], where each player has a nonnegative weight and her cost on the link she chooses is the sum of the weights of all players choosing the link. ...

Article
Facets of the fully mixed Nash equilibrium conjecture
(2010)In this work, we continue the study of the many facets of the Fully Mixed Nash Equilibrium Conjecture, henceforth abbreviated as the FMNE Conjecture, in selfish routing for the special case of n identical users over two ...

Article
Nash equilibria in discrete routing games with convex latency functions
(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 nondecreasing, nonconstant ...

Conference Object
Network uncertainty in selfish routing
(2006)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 ...

Article
A new model for selfish routing
(2008)In this work, we introduce and study a new, potentially rich model for selfish routing over noncooperative networks, as an interesting hybridization of the two prevailing such models, namely the KPmodel [E. Koutsoupias, ...

Article
A new model for selfish routing
(2004)In this work, we introduce and study a new model for selfish routing over noncooperative networks that combines features from the two such best studied models, namely the KP model and the Wardrop model in an interesting ...

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 ...

Article
The structure and complexity of Nash equilibria for a selfish routing game
(2009)In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...

Article
The structure and complexity of Nash equilibria for a selfish routing game
(2002)In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection ...

Article
Which is the worstcase Nash equilibrium?
(2003)A Nash equilibrium of a routing network represents a stable state of the network where no user finds it beneficial to unilaterally deviate from its routing strategy. In this work, we investigate the structure of such ...