Stability vs. optimality in selfish ring routing

DOI10.1007/s10114-014-3055-1zbMath1312.68019OpenAlexW1986879524MaRDI QIDQ2453835

Jie Hu, Bo Chen, Xu-jin Chen

Publication date: 11 June 2014

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: http://wrap.warwick.ac.uk/2535/1/WRAP_Chen_9471193-wbs-060110-submitted_version.pdf

zbMATH Keywords

price of stabilityselfish routingminimum maximum linear latency

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Games involving graphs (91A43)

Related Items (1)

Pairwise cooperations in selfish ring routing for minimax linear latency

Cites Work

• Unnamed Item
• Unnamed Item
• The price of anarchy for polynomial social cost
• The price of atomic selfish ring routing
• Multicuts and integral multiflows in rings
• Potential games
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• How bad is selfish routing?
• Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
• Fast, Fair, and Efficient Flows in Networks
• The Price of Stability for Network Design with Fair Cost Allocation
• On the impact of combinatorial structure on congestion games
• Convergence time to Nash equilibrium in load balancing
• The complexity of pure Nash equilibria
• The price of anarchy of finite congestion games
• The Ring Loading Problem
• Linear time algorithms for the ring loading problem with demand splitting
• Improved Approximation Algorithms for the Demand Routing and Slotting Problem with Unit Demands on Rings
• Atomic Routing Games on Maximum Congestion
• Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
• Algorithms – ESA 2004
• 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: Stability vs. optimality in selfish ring routing