On the performance of approximate equilibria in congestion games (Q634681): 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: Q3579477 / 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: The Price of Routing Unsplittable Flow / 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: A class of games possessing pure-strategy Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / 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: On the performance of approximate equilibria in congestion games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish Routing in Capacitated Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, Fair, and Efficient Flows in Networks / 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: The complexity of computing a Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximate Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pure Nash equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congestion games with player-specific payoff functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Game Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / 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: Q4828932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimization Approach for Approximate Nash Equilibria / rank
 
Normal rank

Latest revision as of 10:06, 4 July 2024

scientific article
Language Label Description Also known as
English
On the performance of approximate equilibria in congestion games
scientific article

    Statements

    On the performance of approximate equilibria in congestion games (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    price of anarchy
    0 references
    price of stability
    0 references
    congestion games
    0 references
    algorithmic game theory
    0 references
    approximate equilibria
    0 references
    selfish routing
    0 references
    0 references
    0 references