A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
From MaRDI portal
Publication:1739106
DOI10.1007/s00453-018-0486-6zbMath1423.05165arXiv1610.09320OpenAlexW2539729130WikidataQ129488699 ScholiaQ129488699MaRDI QIDQ1739106
Ivano Salvo, Pietro Cenciarelli, Daniele Gorla
Publication date: 25 April 2019
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.09320
Related Items (2)
Depletable channels: dynamics, behaviour, and efficiency in network design ⋮ Polynomial recognition of vulnerable multi-commodities
Cites Work
- Unnamed Item
- Network topology and equilibrium existence in weighted network congestion games
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- Network characterizations for excluding Braess's paradox
- Network topology and the efficiency of equilibrium
- Efficient graph topologies in network routing games
- The directed subgraph homeomorphism problem
- The subgraph homeomorphism problem
- Network structure and strong equilibrium in route selection games.
- Inefficiencies in network models: a graph-theoretic perspective
- On the complexity of the disjoint paths problem
- Topology of series-parallel networks
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Depletable Channels: Dynamics and Behaviour
- How bad is selfish routing?
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
- Excluding Braess’s Paradox in Nonatomic Selfish Routing
- The Recognition of Series Parallel Digraphs
- Matroids Are Immune to Braess’ Paradox
- Über ein Paradoxon aus der Verkehrsplanung
- Topological Conditions for Uniqueness of Equilibrium in Networks
This page was built for publication: A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
