Bounding the inefficiency of the C-logit stochastic user equilibrium assignment

DOI10.1007/s11424-016-4320-4zbMath1369.90038OpenAlexW2512240396MaRDI QIDQ2014426

Yanyan Li

Publication date: 25 August 2017

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-016-4320-4

zbMATH Keywords

route overlappinginefficiency boundinglogit-based stochastic user equilibrium

Mathematics Subject Classification ID

Optimal stochastic control (93E20) Traffic problems in operations research (90B20) Stochastic systems in control theory (general) (93E03)

Cites Work

• Unnamed Item
• Unnamed Item
• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
• Method of generating strategic guidance information for driving evacuation flows to approach safety-based system optimal dynamic flows: case study of a large stadium
• Efficiency of atomic splittable selfish routing with polynomial cost functions
• Bounding the inefficiency of logit-based stochastic user equilibrium
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• Bounding the inefficiency of equilibria in nonatomic congestion games
• How bad is selfish routing?
• On the Inefficiency of Equilibria in Congestion Games
• System Optimum, Stochastic User Equilibrium, and Optimal Link Tolls
• Algorithms, games, and the internet
• Selfish Routing in Capacitated Networks
• The price of anarchy is independent of the network topology

This page was built for publication: Bounding the inefficiency of the C-logit stochastic user equilibrium assignment