Efficiency and fairness of system-optimal routing with user constraints
From MaRDI portal
Publication:3418209
DOI10.1002/net.20133zbMath1148.90307OpenAlexW3121217993MaRDI QIDQ3418209
Nicolás E. Stier-Moses, Andreas S. Schulz
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20133
traffic assignmentmulticommodity flowsprice of anarchyselfish routingroute guidancecomputational game theory
Games involving graphs (91A43) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items (11)
The combination of continuous network design and route guidance ⋮ Minimizing the total travel time with limited unfairness in traffic networks ⋮ Scheduling games with rank-based utilities ⋮ Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account ⋮ A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints ⋮ A note on a parameter relating traffic equilibria and system optimal routing ⋮ System optimal routing of traffic flows with user constraints using linear programming ⋮ On the efficiency of equilibria in mean-field oscillator games ⋮ Traffic Networks and Flows over Time ⋮ Gathering avoiding centralized pedestrian advice framework: an application for Covid-19 outbreak restrictions ⋮ THE PRICE OF MULTI-ORGANIZATION CONSTRAINT IN UNRELATED PARALLEL MACHINE SCHEDULING
Cites Work
This page was built for publication: Efficiency and fairness of system-optimal routing with user constraints
