Computing network tolls with support constraints

DOI10.1002/net.21604zbMath1390.90108OpenAlexW2126014631MaRDI QIDQ4642456

Ingo Kleinert, Max Klimm, Tobias Harks, Rolf H. Möhring

Publication date: 23 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.21604

zbMATH Keywords

wardrop equilibriummarginal cost pricingnetwork tollssupport constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (9)

Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Toll caps in privatized road networks ⋮ The minimum tollbooth problem in atomic network congestion games with unsplittable flows ⋮ Congestion games with priority-based scheduling ⋮ Selfish routing in public services ⋮ Wealth Inequality and the Price of Anarchy ⋮ Selfishness Need Not Be Bad

This page was built for publication: Computing network tolls with support constraints