The Influence of Link Restrictions on (Random) Selfish Routing
From MaRDI portal
Publication:5459969
Recommendations
Cites work
- scientific article; zbMATH DE number 2119691 (Why is no real title available?)
- A new average case analysis for completion time scheduling
- Approximation algorithms for scheduling unrelated parallel machines
- Approximation algorithms for single-source unsplittable flow
- Approximation and Online Algorithms
- Automata, Languages and Programming
- Computing Nash equilibria for scheduling on restricted parallel links
- STACS 2004
- Selfish load balancing and atomic congestion games
- Selfish traffic allocation for server farms
- Structure and complexity of extreme Nash equilibria
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- Tight Bounds for Selfish and Greedy Load Balancing
- Tradeoffs and Average-Case Equilibria in Selfish Routing
- Worst-case equilibria
Cited in
(5)
This page was built for publication: The Influence of Link Restrictions on (Random) Selfish Routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459969)