Atomic congestion games with random players: network equilibrium and the price of anarchy

DOI10.1007/s10878-020-00583-3zbMath1503.91025OpenAlexW3027778823MaRDI QIDQ2082222

Chenlan Wang, Bo Chen, Xuan Vinh Doan

Publication date: 4 October 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00583-3

zbMATH Keywords

price of anarchynetwork equilibriumcongestion game

Mathematics Subject Classification ID

Potential and congestion games (91A14)

Cites Work

• Unnamed Item
• Unnamed Item
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Population uncertainty and Poisson games
• A geometric approach to the price of anarchy in nonatomic congestion games
• A class of games possessing pure-strategy Nash equilibria
• Exact Price of Anarchy for Polynomial Congestion Games
• How bad is selfish routing?
• The price of anarchy of finite congestion games
• The “Price of Anarchy” Under Nonlinear and Asymmetric Costs
• Selfish Routing in Capacitated Networks
• The Price of Routing Unsplittable Flow
• The Price of Routing Unsplittable Flow

This page was built for publication: Atomic congestion games with random players: network equilibrium and the price of anarchy