Selfishness Need Not Be Bad

DOI10.1287/opre.2020.2036zbMath1467.91008arXiv1712.07464OpenAlexW3123472234MaRDI QIDQ4994166

Rolf H. Möhring, Zi-jun Wu, Yanyan Chen, Da-Chuan Xu

Publication date: 17 June 2021

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.07464

zbMATH Keywords

price of anarchyselfish routingrouting gameuser behaviornonatomic congestion gamestatic traffic

Mathematics Subject Classification ID

Potential and congestion games (91A14)

Related Items

A game-theoretic analysis of deep neural networks ⋮ A convergence analysis of the price of anarchy in atomic congestion games ⋮ The price of anarchy in routing games as a function of the demand ⋮ A game-theoretic perspective of deep neural networks

Cites Work

• A note on two problems in connexion with graphs
• Bounding the inefficiency of equilibria in nonatomic congestion games
• A class of games possessing pure-strategy Nash equilibria
• On the Price of Anarchy of Highly Congested Nonatomic Network Games
• Intrinsic Robustness of the Price of Anarchy
• How bad is selfish routing?
• On the Inefficiency of Equilibria in Congestion Games
• The Asymptotic Behavior of the Price of Anarchy
• Computing network tolls with support constraints
• When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic
• System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion
• The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
• Algorithmic Game Theory
• Traffic assignment problem for a general network
• Selfish Routing in Capacitated Networks
• The price of anarchy is independent of the network topology
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item