Resolving Braess's paradox in random networks (Q2408090): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-016-0175-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2465605381
@@ Property / OpenAlex ID: W2465605381 / rank @@
+Normal rank
@@ Property / cites work @@
+On sparse approximations to randomized strategies and convex combinations
+Normal rank
@@ Property / cites work @@
+Q2743189
@@ Property / cites work: Q2743189 / rank @@
+Normal rank
@@ Property / cites work @@
+Über ein Paradoxon aus der Verkehrsplanung
@@ Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank @@
+Normal rank
@@ Property / cites work @@
+Q4012216
@@ Property / cites work: Q4012216 / rank @@
+Normal rank
@@ Property / cites work @@
+How much can taxes help selfish routing?
@@ Property / cites work: How much can taxes help selfish routing? / rank @@
+Normal rank
@@ Property / cites work @@
+Braess's paradox in expanders
@@ Property / cites work: Braess's paradox in expanders / rank @@
+Normal rank
@@ Property / cites work @@
+Topology of series-parallel networks
@@ Property / cites work: Topology of series-parallel networks / rank @@
+Normal rank
@@ Property / cites work @@
+Q3286850
@@ Property / cites work: Q3286850 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient methods for selfish network design
@@ Property / cites work: Efficient methods for selfish network design / rank @@
+Normal rank
@@ Property / cites work @@
+Results related to threshold phenomena research in satisfiability: Lower bounds
+Normal rank
@@ Property / cites work @@
+A guided tour of Chernoff bounds
@@ Property / cites work: A guided tour of Chernoff bounds / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness column: An ongoing guide
@@ Property / cites work: The NP-completeness column: An ongoing guide / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Combinatorics, complexity, and randomness
@@ Property / cites work: Combinatorics, complexity, and randomness / rank @@
+Normal rank
@@ Property / cites work @@
+Q3533739
@@ Property / cites work: Q3533739 / rank @@
+Normal rank
@@ Property / cites work @@
+Critical Behavior in the Satisfiability of Random Boolean Expressions
+Normal rank
@@ Property / cites work @@
+Stronger Bounds on Braess's Paradox and the Maximum Latency of Selfish Routing
+Normal rank
@@ Property / cites work @@
+Simple strategies for large zero-sum games with applications to complexity theory
+Normal rank
@@ Property / cites work @@
+Network topology and the efficiency of equilibrium
+Normal rank
@@ Property / cites work @@
+How bad is selfish routing?
@@ Property / cites work: How bad is selfish routing? / rank @@
+Normal rank
@@ Property / cites work @@
+Stackelberg Scheduling Strategies
@@ Property / cites work: Stackelberg Scheduling Strategies / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501360
@@ Property / cites work: Q5501360 / rank @@
+Normal rank
@@ Property / cites work @@
+On the severity of Braess's paradox: designing networks for selfish users is hard
+Normal rank
@@ Property / cites work @@
+Q5687271
@@ Property / cites work: Q5687271 / rank @@
+Normal rank
@@ Property / cites work @@
+Braess's Paradox in large random graphs
@@ Property / cites work: Braess's Paradox in large random graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
+Normal rank