Efficient methods for selfish network design (Q442104): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q169706
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/j.tcs.2012.04.033 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2035766543 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59818405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / 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: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über ein Paradoxon aus der Verkehrsplanung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taxes for Linear Atomic Congestion Games / 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: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg Strategies for Atomic Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish splittable flows and NP-completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg strategies for selfish routing in general multicommodity networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3533739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3873927 / 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: Simple strategies for large zero-sum games with applications to complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of solution in linear programming / 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: A polynomial algorithm for minimum quadratic cost flow problems / 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: Stackelberg Scheduling Strategies / 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: How bad is selfish routing? / rank
 
Normal rank

Latest revision as of 13:41, 5 July 2024

scientific article
Language Label Description Also known as
English
Efficient methods for selfish network design
scientific article

    Statements

    Efficient methods for selfish network design (English)
    0 references
    0 references
    0 references
    0 references
    9 August 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Braess's paradox
    0 references
    selfish flows
    0 references
    Nash equilibrium
    0 references
    real-world networks
    0 references
    equilibrium flow delays
    0 references
    paradox-ridden network
    0 references
    polynomial-time algorithm
    0 references
    linear latency
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references