On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands

DOI10.1016/j.camwa.2008.05.038zbMath1165.91311OpenAlexW2063286775WikidataQ59297182 ScholiaQ59297182MaRDI QIDQ2389520

Deren Han, Hai Yang, Hong Kam Lo

Publication date: 17 July 2009

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2008.05.038

zbMATH Keywords

Nash equilibriumprice of anarchyelastic demandssystem optimumasymmetric cost maps

Mathematics Subject Classification ID

Noncooperative games (91A10) General equilibrium theory (91B50) Consumer behavior, demand theory (91B42)

Related Items

Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery ⋮ The price of anarchy in nonatomic consumption-relevance congestion games

Cites Work

• Unnamed Item
• Unnamed Item
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• A convergence analysis for a convex version of Dikin's algorithm
• The toll effect on price of anarchy when costs are nonlinear and asymmetric
• How bad is selfish routing?
• Selfish Routing in Capacitated Networks
• Integer Programming and Combinatorial Optimization
• Integer Programming and Combinatorial Optimization
• Network economics. A variational inequality approach.

This page was built for publication: On the price of anarchy for non-atomic congestion games under asymmetric cost maps and elastic demands