On the severity of Braess's paradox: designing networks for selfish users is hard (Q2496322): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding paradoxes in multi-agent competitive routing. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal network design with selfish agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of Dynamic Traffic Equilibrium Involving Bottlenecks, Including a Paradox and Metering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic checking of proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braess's paradox in a loss network / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Downs-Thomson Effect in a Markov Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braess's paradox and power-law nonlinearities in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braess's paradox in a queueing network with state-dependent routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Traffic Equilibrium Paradoxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy for non-atomic congestion games with symmetric cost maps and elastic demands. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A paradox of congestion in a queuing network / 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: Pricing network edges for heterogeneous selfish users / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish traffic allocation for server farms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Traffic assignment problem for a general network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queue Spillovers in Transportation Networks with a Route Choice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate algorithms for optimal network design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of Nash Equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a network creation game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive proofs and the hardness of approximating cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Braess paradox / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3037094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3657778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computational Approach to the Selection of an Optimal Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Braess-like paradoxes in distributed computer systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacity allocation under noncooperative routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding the Braess paradox in non-cooperative networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network economics: a variational inequality approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg Scheduling Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy is independent of the network topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the inefficiency of equilibria in nonatomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Prevalence of Paradoxes in Transportation Equilibrium Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: BRAESS' PARADOX IN A TWO-TERMINAL TRANSPORTATION NETWORK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples for comparisons of queues with finite waiting rooms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725894 / rank
 
Normal rank

Latest revision as of 18:04, 24 June 2024

scientific article
Language Label Description Also known as
English
On the severity of Braess's paradox: designing networks for selfish users is hard
scientific article

    Statements

    On the severity of Braess's paradox: designing networks for selfish users is hard (English)
    0 references
    0 references
    12 July 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    selfish routing
    0 references
    Braess's paradox
    0 references
    network design
    0 references
    approximation algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references