The price of atomic selfish ring routing
From MaRDI portal
Publication:975753
DOI10.1007/S10878-008-9171-ZzbMATH Open1188.90047OpenAlexW2000021718MaRDI QIDQ975753FDOQ975753
Authors: Bo Chen, Xujin Chen, Xiaodong Hu 
Publication date: 11 June 2010
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-008-9171-z
Recommendations
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Worst-case equilibria
- The price of anarchy is independent of the network topology
- A class of games possessing pure-strategy Nash equilibria
- How bad is selfish routing?
- Potential games
- The Price of Stability for Network Design with Fair Cost Allocation
- Selfish unsplittable flows
- The complexity of pure Nash equilibria
- The price of anarchy of finite congestion games
- The price of routing unsplittable flow
- Network Games with Atomic Players
- Automata, Languages and Programming
- Title not available (Why is that?)
- The Ring Loading Problem
- Fast, Fair, and Efficient Flows in Networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Atomic Routing Games on Maximum Congestion
Cited In (5)
- Balancing Load via Small Coalitions in Selfish Ring Routing Games
- Pairwise cooperations in selfish ring routing for minimax linear latency
- Optimal pricing of crowdsourcing logistics services with social delivery capacity
- Reducing the maximum latency of selfish ring routing via pairwise cooperations
- Stability vs. optimality in selfish ring routing
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)
