Sciweavers

168 search results - page 1 / 34
» The price of selfish routing
Sort
View
STOC
2001
ACM
103views Algorithms» more  STOC 2001»
14 years 5 months ago
The price of selfish routing
Marios Mavronicolas, Paul G. Spirakis
ICS
2010
Tsinghua U.
14 years 2 months ago
A New Look at Selfish Routing
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
Christos Papadimitriou, Gregory Valiant
SODA
2004
ACM
118views Algorithms» more  SODA 2004»
13 years 6 months ago
The maximum latency of selfish routing
We give several new upper and lower bounds on the worst-case severity of Braess's Paradox and the price of anarchy of selfish routing with respect to the maximum latency obje...
Tim Roughgarden
ESA
2007
Springer
153views Algorithms» more  ESA 2007»
13 years 8 months ago
Tradeoffs and Average-Case Equilibria in Selfish Routing
We consider the price of selfish routing in terms of tradeoffs and from an average-case perspective. Each player in a network game seeks to send a message with a certain length by...
Martin Hoefer, Alexander Souza