The Influence of Link Restrictions on (Random) Selfish Routing
From MaRDI portal
Publication:5459969
DOI10.1007/978-3-540-79309-0_4zbMath1136.91343OpenAlexW1524913731MaRDI QIDQ5459969
Alexander Souza, Martin Hoefer
Publication date: 2 May 2008
Published in: Algorithmic Game Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-79309-0_4
Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Games involving graphs (91A43) (n)-person games, (n>2) (91A06)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for scheduling unrelated parallel machines
- Selfish load balancing and atomic congestion games
- Structure and complexity of extreme Nash equilibria
- Approximation Algorithms for Single-Source Unsplittable Flow
- Selfish traffic allocation for server farms
- The price of anarchy of finite congestion games
- Tight Bounds for Selfish and Greedy Load Balancing
- STACS 2004
- Automata, Languages and Programming
- Approximation and Online Algorithms
- Tradeoffs and Average-Case Equilibria in Selfish Routing
- A new average case analysis for completion time scheduling
- Computing Nash equilibria for scheduling on restricted parallel links
- The Price of Routing Unsplittable Flow
This page was built for publication: The Influence of Link Restrictions on (Random) Selfish Routing