Models of Non-atomic Congestion Games – From Unicast to Multicast Routing

DOI10.1007/978-3-642-02094-0_14zbMath1248.91010OpenAlexW8683593MaRDI QIDQ3637323

Lasse Kliemann, Anand Srivastav

Publication date: 9 July 2009

Published in: Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02094-0_14

zbMATH Keywords

multicast routingprice of anarchyWardrop modelunicast routingnon-atomic congestion games

Mathematics Subject Classification ID

Noncooperative games (91A10) Games involving graphs (91A43)

Related Items

The price of anarchy in nonatomic consumption-relevance congestion games

Uses Software

• LANCELOT
• Ipopt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Network economics: a variational inequality approach
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• The price of anarchy in nonatomic consumption-relevance congestion games
• Fast convergence to Wardrop equilibria by adaptive sampling methods
• How bad is selfish routing?
• Approximating Wardrop Equilibria with Finitely Many Agents
• The Price of Anarchy in Selfish Multicast Routing
• Über ein Paradoxon aus der Verkehrsplanung
• Traffic assignment problem for a general network
• Selfish Routing in Capacitated Networks

This page was built for publication: Models of Non-atomic Congestion Games – From Unicast to Multicast Routing