Selfish load balancing for jobs with favorite machines

DOI10.1016/J.ORL.2018.11.004zbMath1476.90109OpenAlexW2901005964WikidataQ128988400 ScholiaQ128988400MaRDI QIDQ2294253

Cong Chen, Yin-Feng Xu

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2018.11.004

zbMATH Keywords

load balancing game(strong) price of anarchyfavorite machine

Mathematics Subject Classification ID

Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Online scheduling of jobs with favorite machines ⋮ Coordination mechanisms for scheduling selfish jobs with favorite machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure and complexity of Nash equilibria for a selfish routing game
• Strong price of anarchy
• Scheduling problems on two sets of identical machines
• Selfish jobs with favorite machines: price of anarchy vs. strong price of anarchy
• Approximate equilibria and ball fusion
• Tradeoffs in worst-case equilibria
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• ONLINE SCHEDULING OF MIXED CPU-GPU JOBS
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Convergence time to Nash equilibrium in load balancing
• Bounds for List Schedules on Uniform Processors
• Bounds for LPT Schedules on Uniform Processors
• Strong Price of Anarchy for Machine Load Balancing
• Automata, Languages and Programming

This page was built for publication: Selfish load balancing for jobs with favorite machines