The price of atomic selfish ring routing
From MaRDI portal
Publication:975753
Recommendations
Cites work
- scientific article; zbMATH DE number 1003273 (Why is no real title available?)
- scientific article; zbMATH DE number 1303573 (Why is no real title available?)
- scientific article; zbMATH DE number 1830730 (Why is no real title available?)
- A class of games possessing pure-strategy Nash equilibria
- Atomic Routing Games on Maximum Congestion
- Automata, Languages and Programming
- Fast, Fair, and Efficient Flows in Networks
- How bad is selfish routing?
- Network Games with Atomic Players
- Potential games
- Selfish unsplittable flows
- The Price of Stability for Network Design with Fair Cost Allocation
- The Ring Loading Problem
- The complexity of pure Nash equilibria
- The price of anarchy is independent of the network topology
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- Worst-case equilibria
Cited in
(5)- Optimal pricing of crowdsourcing logistics services with social delivery capacity
- Pairwise cooperations in selfish ring routing for minimax linear latency
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- Stability vs. optimality in selfish ring routing
- Reducing the maximum latency of selfish ring routing via pairwise cooperations
This page was built for publication: The price of atomic selfish ring routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975753)