Network characterizations for excluding Braess's paradox
From MaRDI portal
Publication:506543
DOI10.1007/S00224-016-9710-4zbMATH Open1356.91030OpenAlexW2530722280MaRDI QIDQ506543FDOQ506543
Authors: Zhuo Diao, Xujin Chen, Xiaodong Hu 
Publication date: 1 February 2017
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-016-9710-4
Recommendations
series-parallel graphBraess's paradoxmulti-commodity networknonatomic selfish routingsingle-commodity network
Cites Work
- Worst-case equilibria
- On the severity of Braess's paradox: designing networks for selfish users is hard
- How bad is selfish routing?
- Über ein Paradoxon aus der Verkehrsplanung
- The directed subgraph homeomorphism problem
- Title not available (Why is that?)
- The Recognition of Series Parallel Digraphs
- Efficient graph topologies in network routing games
- Network structure and strong equilibrium in route selection games.
- Network topology and the efficiency of equilibrium
- Topological Conditions for Uniqueness of Equilibrium in Networks
- Finding k Disjoint Paths in a Directed Planar Graph
- On the hardness of network design for bottleneck routing games
- Approximation and Online Algorithms
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- Inefficiencies in network models: a graph-theoretic perspective
- Stronger bounds on Braess's paradox and the maximum latency of selfish routing
- Matroids are immune to Braess' paradox
Cited In (16)
- Inefficiencies in network models: a graph-theoretic perspective
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Matroids are immune to Braess' paradox
- Excluding Braess's paradox in nonatomic selfish routing
- Efficient black-box reductions for separable cost sharing
- Efficient black-box reductions for separable cost sharing
- A Characterization of Undirected Graphs Admitting Optimal Cost Shares
- A faster algorithm for recognizing directed graphs invulnerable to Braess's paradox
- Unreasonable implications of reasonable idiotypic network assumptions
- Informational Braess' paradox: the effect of information on traffic congestion
- A note on social learning in non-atomic routing games
- Social learning in nonatomic routing games
- On weak Pareto optimality of nonatomic routing networks
- Depletable channels: dynamics, behaviour, and efficiency in network design
- Escaping Braess's paradox through approximate Caratheodory's theorem
- Polynomial recognition of vulnerable multi-commodities
This page was built for publication: Network characterizations for excluding Braess's paradox
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q506543)
