Selfish load balancing for jobs with favorite machines (Q2294253): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q128988400, #quickstatements; #temporary_batch_1730405342757
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yin-Feng Xu / rank
Normal rank
 
Property / author
 
Property / author: Yin-Feng Xu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2018.11.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2901005964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tradeoffs in worst-case equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONLINE SCHEDULING OF MIXED CPU-GPU JOBS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for List Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for worst-case equilibria / 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: Strong Price of Anarchy for Machine Load Balancing / 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 for LPT Schedules on Uniform Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling problems on two sets of identical machines / 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: Q4051611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance Guarantees of Local Search for Multiprocessor Scheduling / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128988400 / rank
 
Normal rank

Latest revision as of 21:09, 31 October 2024

scientific article
Language Label Description Also known as
English
Selfish load balancing for jobs with favorite machines
scientific article

    Statements

    Selfish load balancing for jobs with favorite machines (English)
    0 references
    0 references
    0 references
    10 February 2020
    0 references
    load balancing game
    0 references
    favorite machine
    0 references
    (strong) price of anarchy
    0 references

    Identifiers