Improved lower bounds on the price of stability of undirected network design games (Q2392248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the Value of Coordination in Network Design / 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: Tight Bounds for Selfish and Greedy Load Balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design with weighted players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Price of Stability for Undirected Network Design / 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: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\frac{\log n}{\log \log n})\) upper bound on the price of stability for undirected Shapley network design 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

Revision as of 16:33, 6 July 2024

scientific article
Language Label Description Also known as
English
Improved lower bounds on the price of stability of undirected network design games
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references