The price of atomic selfish ring routing

DOI10.1007/s10878-008-9171-zzbMath1188.90047OpenAlexW2000021718MaRDI QIDQ975753

Bo Chen, Xiao-Dong Hu, Xu-jin Chen

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

zbMATH Keywords

Nash equilibriumprice of stabilityselfish routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (4)

Optimal pricing of crowdsourcing logistics services with social delivery capacity ⋮ Pairwise cooperations in selfish ring routing for minimax linear latency ⋮ Stability vs. optimality in selfish ring routing ⋮ Balancing Load via Small Coalitions in Selfish Ring Routing Games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Potential games
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• How bad is selfish routing?
• Fast, Fair, and Efficient Flows in Networks
• The Price of Stability for Network Design with Fair Cost Allocation
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• Network Games with Atomic Players
• The Ring Loading Problem
• Atomic Routing Games on Maximum Congestion
• Automata, Languages and Programming
• The Price of Routing Unsplittable Flow
• The price of anarchy is independent of the network topology

This page was built for publication: The price of atomic selfish ring routing