Tight Bounds for Cost-Sharing in Weighted Congestion Games (Q3449511): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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: W1134766267 / rank
 
Normal rank
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: The Price of Routing Unsplittable Flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design with weighted players / rank
 
Normal rank
Property / cites work
 
Property / cites work: Designing Network Protocols for Good Equilibria / 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: Optimal Cost-Sharing in Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential Games Are <i>Necessary</i> to Ensure Pure Nash Equilibria in Cost Sharing 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: Sharing Non-anonymous Costs of Multiple Resources Optimally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restoring Pure Equilibria to Weighted Congestion Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Potential 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: Intrinsic robustness of the price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Cost-Sharing without Anonymity / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality theory of convex semi-infinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:12, 11 July 2024

scientific article
Language Label Description Also known as
English
Tight Bounds for Cost-Sharing in Weighted Congestion Games
scientific article

    Statements

    Tight Bounds for Cost-Sharing in Weighted Congestion Games (English)
    0 references
    0 references
    0 references
    0 references
    4 November 2015
    0 references
    weighted congestion games
    0 references
    price of anarchy
    0 references
    price of stability
    0 references
    Shapley value
    0 references

    Identifiers