ABSTRACT
No abstract available.
Recommendations
Braess's paradox in large random graphs
EC '06: Proceedings of the 7th ACM conference on Electronic commerceBraess's Paradox is the counterintuitive but well-known fact that removing edges from a network with "selfish routing" can decrease the latency incurred by traffic in an equilibrium flow. Despite the large amount of research motivated by Braess's ...
Braess's paradox for flows over time
SAGT'10: Proceedings of the Third international conference on Algorithmic game theoryWe study the properties of Braess's paradox in the context of the model of congestion games with flow over time introduced by Koch and Skutella. We compare them to the well known properties of Braess's paradox for Wardrop's model of games with static ...
Stronger Bounds on Braess's Paradox and 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 objective. In single-commodity networks with arbitrary continuous and nondecreasing ...
Comments