Bottleneck Congestion Games with Logarithmic Price of Anarchy (Q3162521): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
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 / OpenAlex ID
 
Property / OpenAlex ID: W3137478448 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1003.4307 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Congestion + Dilation in Networks via "Quality of Routing” Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic routing games on maximum congestion / 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: Integer Programming and Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish unsplittable flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Nash equilibria for scheduling on restricted parallel links / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate equilibria and ball fusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic resource sharing in noncooperative networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new model for selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, games, and the internet / 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: Q5501360 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921792 / 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: Selfish load balancing and atomic congestion games / rank
 
Normal rank

Latest revision as of 09:15, 3 July 2024

scientific article
Language Label Description Also known as
English
Bottleneck Congestion Games with Logarithmic Price of Anarchy
scientific article

    Statements

    Bottleneck Congestion Games with Logarithmic Price of Anarchy (English)
    0 references
    0 references
    0 references
    19 October 2010
    0 references

    Identifiers