Resolving Braess's paradox in random networks
From MaRDI portal
Publication:2408090
DOI10.1007/s00453-016-0175-2zbMath1380.91033OpenAlexW2465605381MaRDI QIDQ2408090
Dimitris Fotakis, Thanasis Lianeas, Alexis C. Kaporis, Paul G. Spirakis
Publication date: 9 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0175-2
Analysis of algorithms and problem complexity (68Q25) Random graphs (graph-theoretic aspects) (05C80) Games involving graphs (91A43) Stochastic network models in operations research (90B15)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient methods for selfish network design
- Network topology and the efficiency of equilibrium
- A guided tour of Chernoff bounds
- On sparse approximations to randomized strategies and convex combinations
- Topology of series-parallel networks
- How much can taxes help selfish routing?
- On the severity of Braess's paradox: designing networks for selfish users is hard
- Simple strategies for large zero-sum games with applications to complexity theory
- Braess's Paradox in large random graphs
- Critical Behavior in the Satisfiability of Random Boolean Expressions
- Braess's paradox in expanders
- How bad is selfish routing?
- Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Combinatorics, complexity, and randomness
- Stackelberg Scheduling Strategies
- Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Über ein Paradoxon aus der Verkehrsplanung
- The NP-completeness column: An ongoing guide
- Results related to threshold phenomena research in satisfiability: Lower bounds
