Worst-case Nash equilibria in restricted routing
From MaRDI portal
Publication:2637289
DOI10.1007/s11390-012-1257-5zbMath1280.68056OpenAlexW2087276235MaRDI QIDQ2637289
Publication date: 11 February 2014
Published in: Journal of Computer Science and Technology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11390-012-1257-5
Network design and communication in computer systems (68M10) Games involving graphs (91A43) Deterministic network models in operations research (90B10)
Related Items
Scheduling games with machine-dependent priority lists, Performance guarantees for scheduling algorithms under perturbed machine speeds
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Coordination mechanisms
- Bounding the inefficiency of equilibria in nonatomic congestion games
- Tradeoffs in worst-case equilibria
- A linear time approximation algorithm for multiprocessor scheduling
- How bad is selfish routing?
- The Competitiveness of On-Line Assignments
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- The price of anarchy is independent of the network topology
- Computing Nash equilibria for scheduling on restricted parallel links