Braess's paradox in expanders
From MaRDI portal
Publication:3145837
DOI10.1002/rsa.20457zbMath1256.05226OpenAlexW2082544030MaRDI QIDQ3145837
Wen-Bo Zhao, Stephen J. Young, Fan R. K. Chung
Publication date: 14 December 2012
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20457
Related Items
Resolving Braess's paradox in random networks ⋮ Braess's paradox for the spectral gap in random graphs and delocalization of eigenvectors ⋮ Escaping Braess's paradox through approximate Caratheodory's theorem
Cites Work
- Unnamed Item
- Network topology and the efficiency of equilibrium
- The geometry of graphs and some of its algorithmic applications
- On certain connectivity properties of the internet topology
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Edge-Disjoint Paths in Expander Graphs
- Braess's Paradox in large random graphs
- Expander graphs in pure and applied mathematics
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- How bad is selfish routing?
- Expander graphs and their applications
- The Braess paradox
- The Structure and Function of Complex Networks
- Algorithms, games, and the internet
- Efficient Methods for Selfish Network Design
- Probability Inequalities for Sums of Bounded Random Variables
- Collective dynamics of ‘small-world’ networks
- Über ein Paradoxon aus der Verkehrsplanung
