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

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

Latest revision as of 12:10, 14 July 2024

scientific article
Language Label Description Also known as
English
Resolving Braess's paradox in random networks
scientific article

    Statements

    Resolving Braess's paradox in random networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 October 2017
    0 references
    algorithmic game theory
    0 references
    Braess's paradox
    0 references
    selfish routing
    0 references
    Wardrop equilibrium
    0 references
    random graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references