Transportation network with externalities

DOI10.1016/j.cam.2020.113091zbMath1448.90035OpenAlexW3039393115MaRDI QIDQ2196061

Vladimir V. Mazalov, Zhonghong Kuang, Xindi Tang, Jie Zheng

Publication date: 28 August 2020

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2020.113091

zbMATH Keywords

price of anarchytraffic flowexternalityWardrop equilibriumlinear latency function

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (5)

Pricing equilibrium of transportation systems with behavioral commuters ⋮ Optimal externalities in a parallel transportation network ⋮ Unnamed Item ⋮ Foreword to the virtual special issue dedicated to the 3rd international conference NUMTA 2019 ``Numerical computations: theory and algorithms ⋮ Machine load balancing game with linear externalities

Cites Work

• Unnamed Item
• Competitive routing of traffic flows by navigation providers
• Worst-case equilibria
• Pricing equilibrium of transportation systems with behavioral commuters
• Selfish load balancing and atomic congestion games
• Strong price of anarchy
• To queue or not to queue: equilibrium behavior in queueing systems.
• A survey on networking games in telecommunications
• Wardrop Equilibrium for Networks with the BPR Latency Function
• Taxes for linear atomic congestion games
• The price of anarchy of finite congestion games
• Routing (Un-) Splittable Flow in Games with Player-Specific Linear Latency Functions
• Algorithms, games, and the internet
• Equilibrium Prices and Flows in the Passenger Traffic Problem
• The price of anarchy is independent of the network topology

This page was built for publication: Transportation network with externalities