Maximizing the minimum load: the cost of selfishness (Q390908): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5501827 / 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 Santa Claus problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A performance guarantee for the greedy set-partitioning algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System / rank
 
Normal rank
Property / cites work
 
Property / cites work: Truthful Approximation Schemes for Single-Parameter Agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2957914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Online Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum load: the cost of selfishness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cost of selfishness for maximizing the minimum load on uniformly related machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Approach to Truthful Scheduling on Related Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the minimum load for selfish agents / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence time to Nash equilibrium in load balancing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time approximation algorithm for multiprocessor scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure and complexity of Nash equilibria for a selfish routing game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3409969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The price of selfish routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-cooperative games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic mechanism design / rank
 
Normal rank
Property / cites work
 
Property / cites work: How bad is selfish routing? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees of Local Search for Multiprocessor Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inefficiency of equilibria for the machine covering game on uniform machines / rank
 
Normal rank

Latest revision as of 05:35, 7 July 2024

scientific article
Language Label Description Also known as
English
Maximizing the minimum load: the cost of selfishness
scientific article

    Statements

    Maximizing the minimum load: the cost of selfishness (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 January 2014
    0 references
    scheduling
    0 references
    price of anarchy
    0 references
    machine covering
    0 references
    envy-ratio
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers