Coordination mechanisms for scheduling selfish jobs with favorite machines

DOI10.1007/s10878-020-00592-2zbMath1448.90041OpenAlexW3035675602MaRDI QIDQ782743

Cong Chen, Yin-Feng Xu

Publication date: 29 July 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-020-00592-2

zbMATH Keywords

related machinescoordination mechanismload balancing game(strong) price of anarchy

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A coordination mechanism for a scheduling game with parallel-batching machines
• Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
• Coordination mechanisms
• Strong price of anarchy
• Coordination mechanisms for selfish scheduling
• Coordination mechanisms for scheduling games with proportional deterioration
• An almost ideal coordination mechanism for unrelated machine scheduling
• Sequential scheduling on identical machines
• On the price of anarchy of two-stage machine scheduling games
• Online scheduling of jobs with favorite machines
• Selfish load balancing for jobs with favorite machines
• Improved price of anarchy for machine scheduling games with coordination mechanisms
• Some anomalies of farsighted strategic behavior
• Efficient coordination mechanisms for unrelated machine scheduling
• The price of anarchy for utilitarian scheduling games on related machines
• Efficiency analysis of load balancing games with and without activation costs
• Tradeoffs in worst-case equilibria
• The curse of simultaneity
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• The Sequential Price of Anarchy for Atomic Congestion Games
• ONLINE SCHEDULING OF MIXED CPU-GPU JOBS
• Tight bounds for worst-case equilibria
• A linear time approximation algorithm for multiprocessor scheduling
• Optimal Coordination Mechanisms for Unrelated Machine Scheduling
• Approximate Strong Equilibrium in Job Scheduling Games
• Bounds for List Schedules on Uniform Processors
• Bounds for LPT Schedules on Uniform Processors
• Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling
• Strong Price of Anarchy for Machine Load Balancing
• The Price of Stochastic Anarchy

This page was built for publication: Coordination mechanisms for scheduling selfish jobs with favorite machines