Modifying link capacity to avoid Braess paradox considering elastic demand
From MaRDI portal
Publication:2675881
DOI10.1016/j.physa.2022.127951OpenAlexW4286255035MaRDI QIDQ2675881
Yuanhua Tang, Yasir Tariq Mohmand, Pei Xu, Ai-Hu Wang
Publication date: 26 September 2022
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2022.127951
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A modified gradient projection algorithm for solving the elastic demand traffic assignment problem
- A framework for and empirical study of algorithms for traffic assignment
- Network topology and the efficiency of equilibrium
- Efficient graph topologies in network routing games
- Toll caps in privatized road networks
- Locating inefficient links in a large-scale transportation network
- Entanglement and quantum strategies reduce congestion costs in Pigou networks
- How much can taxes help selfish routing?
- On the severity of Braess's paradox: designing networks for selfish users is hard
- The effectiveness of stackelberg strategies and tolls for network congestion games
- How bad is selfish routing?
- Origin-Based Algorithm for the Traffic Assignment Problem
- Informational Braess’ Paradox: The Effect of Information on Traffic Congestion
- Price of Anarchy in Networks with Heterogeneous Latency Functions
- When is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic
- Über ein Paradoxon aus der Verkehrsplanung
This page was built for publication: Modifying link capacity to avoid Braess paradox considering elastic demand
