A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (Q722221): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exact Price of Anarchy for Polynomial Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Stability for Network Design with Fair Cost Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of approximation algorithms for \(k\)-set cover using factor-revealing linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Routing Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252723 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unifying Tool for Bounding the Quality of Non-cooperative Solutions in Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Congestion Games with Altruistic Social Context / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Robustness of the Approximate Price of Anarchy in Generalized Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of one-round walks in linear congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lookahead equilibria in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some anomalies of farsighted strategic behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the performance of mildly greedy players in cut games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Stackelberg Strategies in Affine Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of Pure Nash Equilibria in Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wavelength Management in WDM Rings to Maximize the Number of Connections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Taxes for linear atomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious algorithms for the maximum directed cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for selfish and greedy load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong and Pareto Price of Anarchy in Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Price of Stability in Polynomial Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of anarchy of finite congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the performance of approximate equilibria in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and approximation in potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stackelberg strategies for atomic congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing the existence of potential functions in weighted congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online bipartite matching with random arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theoretical Examination of Practical Game Playing: Lookahead Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: The curse of simultaneity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for pure Nash equilibria in weighted congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish load balancing and atomic congestion games / rank
 
Normal rank

Latest revision as of 05:09, 16 July 2024

scientific article
Language Label Description Also known as
English
A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games
scientific article

    Statements

    A unifying tool for bounding the quality of non-cooperative solutions in weighted congestion games (English)
    0 references
    0 references
    23 July 2018
    0 references
    0 references
    price of anarchy and stability
    0 references
    performance of one-round walks
    0 references
    (approximate) Nash equilibria
    0 references
    congestion games
    0 references
    primal-dual analysis
    0 references
    0 references
    0 references
    0 references
    0 references