Pairwise cooperations in selfish ring routing for minimax linear latency

DOI10.1016/j.tcs.2011.11.031zbMath1247.68015OpenAlexW2073584554MaRDI QIDQ443709

Xu-jin Chen, Weidong Ma, Xiao-Dong Hu

Publication date: 13 August 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.11.031

zbMATH Keywords

Nash equilibriumprice of anarchypairwise stabilityselfish routinglinear latency

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Applications of game theory (91A80)

Cites Work

• Unnamed Item
• Worst-case equilibria
• The price of atomic selfish ring routing
• Strong price of anarchy
• Multicuts and integral multiflows in rings
• Potential games
• Stability vs. optimality in selfish ring routing
• A class of games possessing pure-strategy Nash equilibria
• How bad is selfish routing?
• The Price of Stability for Network Design with Fair Cost Allocation
• The price of anarchy of finite congestion games
• The Ring Loading Problem
• Linear time algorithms for the ring loading problem with demand splitting
• Path decomposition under a new cost measure with applications to optical network design
• Algorithms, games, and the internet
• Algorithmic Game Theory
• The Price of Routing Unsplittable Flow
• The price of anarchy is independent of the network topology

This page was built for publication: Pairwise cooperations in selfish ring routing for minimax linear latency