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

DOI10.1007/S11424-016-4320-4MaRDI QIDQ2014426zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Bounding the inefficiency of logit-based stochastic user equilibrium
• Decomposition of Path Choice Entropy in General Transport Networks
• Bounding the efficiency loss with mixed equilibrium associated with user equilibrium and logit-based stochastic user equilibrium in a transportation network
• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
• A stochastic user equilibrium formulation for the cumulative prospect theory-based cross-nested logit

Cites work

• scientific article; zbMATH DE number 6469241 (Why is no real title available?)
• Algorithms, games, and the internet
• Bounding the inefficiency of equilibria in nonatomic congestion games
• Bounding the inefficiency of logit-based stochastic user equilibrium
• Efficiency of atomic splittable selfish routing with polynomial cost functions
• How bad is selfish routing?
• 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
• On the Inefficiency of Equilibria in Congestion Games
• Selfish Routing in Capacitated Networks
• System Optimum, Stochastic User Equilibrium, and Optimal Link Tolls
• The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands.
• The price of anarchy is independent of the network topology
• Worst-case equilibria

Cited in

(10)

• scientific article; zbMATH DE number 7313217 (Why is no real title available?)
• A stochastic user equilibrium formulation for the cumulative prospect theory-based cross-nested logit
• Inefficiency of logit-based stochastic user equilibrium in a traffic network under ATIS
• Bounding the efficiency loss with mixed equilibrium associated with user equilibrium and logit-based stochastic user equilibrium in a transportation network
• Finding the \(\varepsilon\)-user equilibrium solution using an augmented Frank-Wolfe algorithm
• C-Weibit discrete choice model: a path based approach
• A dimension-reduced method of sensitivity analysis for stochastic user equilibrium assignment model
• Route choice modeling with overlapping in super-networks
• A simplified C-logit stochastic user equilibrium model on bimodal transportation network
• Bounding the inefficiency of logit-based stochastic user equilibrium

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014426)