On the Price of Anarchy of Highly Congested Nonatomic Network Games

DOI10.1007/978-3-662-53354-3_10zbMath1403.91064arXiv1605.03081OpenAlexW3105382306MaRDI QIDQ2819452

Riccardo Colini-Baldeschi, Marco Scarsini, Roberto Cominetti

Publication date: 29 September 2016

Published in: Algorithmic Game Theory (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic price of anarchynonatomic network games

Mathematics Subject Classification ID

Games involving graphs (91A43) Games with infinitely many players (91A07)

Related Items (4)

A convergence analysis of the price of anarchy in atomic congestion games ⋮ When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic ⋮ A Gibbsian model for message routeing in highly dense multihop networks ⋮ Selfishness Need Not Be Bad

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sensitivity of Wardrop equilibria
• On a theorem of Schmeidler
• Social optimality and cooperation in nonatomic congestion games.
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Equilibrium points of nonatomic games
• A geometric approach to the price of anarchy in nonatomic congestion games
• Generic Uniqueness of Equilibrium in Large Crowding Games
• How bad is selfish routing?
• Fast, Fair, and Efficient Flows in Networks
• Algorithms, games, and the internet
• The price of anarchy in large games
• Selfish Routing in Capacitated Networks
• The price of anarchy is independent of the network topology

This page was built for publication: On the Price of Anarchy of Highly Congested Nonatomic Network Games