On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games (Q3162531): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
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: Q2934597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceptable points in games of perfect information / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Price of Routing Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoffs in worst-case equilibria / 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: Tight bounds for worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Price of Anarchy for Machine Load Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coordination mechanisms for selfish scheduling / 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: Worst-case equilibria / 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

Latest revision as of 08:15, 3 July 2024

scientific article
Language Label Description Also known as
English
On the Inefficiency of Equilibria in Linear Bottleneck Congestion Games
scientific article

    Statements

    Identifiers