Computing all Wardrop Equilibria parametrized by the Flow Demand

DOI10.1137/1.9781611975482.56zbMath1431.90034arXiv1805.12383OpenAlexW2805345954MaRDI QIDQ5236240

Philipp Warode, Max Klimm

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.12383

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Nonnumerical algorithms (68W05) Special types of economic equilibria (91B52) Deterministic network models in operations research (90B10)

Related Items (2)

Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ The price of anarchy in routing games as a function of the demand

This page was built for publication: Computing all Wardrop Equilibria parametrized by the Flow Demand