A convergence analysis of the price of anarchy in atomic congestion games

DOI10.1007/s10107-022-01853-0zbMath1512.91010arXiv2007.14769OpenAlexW3046177419MaRDI QIDQ6038662

Zi-jun Wu, Rolf H. Möhring, Da-Chuan Xu, Chunying Ren

Publication date: 2 May 2023

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

price of anarchyinefficiency of equilibriaatomic congestion gamespure and mixed Nash equilibria

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Games on graphs (graph-theoretic aspects) (05C57) Potential and congestion games (91A14) Algorithmic game theory and complexity (91A68)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing the existence of potential functions in weighted congestion games
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• Potential games
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Nonatomic aggregative games with infinitely many types
• A generalization of Chebyshev's inequality for Hilbert-space-valued random elements
• Convexity of the bounds induced by Markov's inequality
• A class of games possessing pure-strategy Nash equilibria
• Selfish unsplittable flows
• Generic Uniqueness of Equilibrium in Large Crowding Games
• On the Price of Anarchy of Highly Congested Nonatomic Network Games
• Intrinsic Robustness of the Price of Anarchy
• How bad is selfish routing?
• The price of anarchy of finite congestion games
• On the Inefficiency of Equilibria in Congestion Games
• On the relationship between Nash—Cournot and Wardrop equilibria
• The Asymptotic Behavior of the Price of Anarchy
• Selfishness Need Not Be Bad
• 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
• Probability Inequalities for Sums of Bounded Random Variables
• The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
• Algorithmic Game Theory
• Traffic assignment problem for a general network
• Analytic Inequalities
• Selfish Routing in Capacitated Networks
• Jensen’s inequality
• Equilibrium points in n -person games
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• The price of anarchy is independent of the network topology

This page was built for publication: A convergence analysis of the price of anarchy in atomic congestion games