Bounding the inefficiency of logit-based stochastic user equilibrium

DOI10.1016/J.EJOR.2009.03.023zbMath1178.90041OpenAlexW2042376321MaRDI QIDQ1037672

Xiaolei Guo, Tian-Liang Liu, Hai Yang

Publication date: 16 November 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://scholar.uwindsor.ca/odettepub/46

zbMATH Keywords

transportationboundstochastic user equilibriuminefficiencyselfish routing

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (6)

Exploring trust region method for the solution of logit-based stochastic user equilibrium problem ⋮ Toll caps in privatized road networks ⋮ Bounding the inefficiency of the reliability-based continuous network design problem under cost recovery ⋮ Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS ⋮ Bounding the inefficiency of the C-logit stochastic user equilibrium assignment ⋮ A mixed traffic assignment problem and its upper bound of efficiency loss

Cites Work

• Unnamed Item
• Efficiency of atomic splittable selfish routing with polynomial cost functions
• 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
• The toll effect on price of anarchy when costs are nonlinear and asymmetric
• 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 logit-based stochastic user equilibrium