Strategic Scheduling Games: Equilibria and Efficiency

DOI10.1007/978-1-4614-1123-9_10zbMath1355.91002OpenAlexW1988254830MaRDI QIDQ2958675

Jérôme Monnot, Laurent Gourvès, Orestis A. Telelis

Publication date: 3 February 2017

Published in: Just-in-Time Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-1123-9_10

Mathematics Subject Classification ID

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

Cites Work

• Approximation algorithms for scheduling unrelated parallel machines
• Acceptable points in games of perfect information
• Truthful algorithms for scheduling selfish tasks on parallel machines
• Lot-sizing scheduling with batch setup times
• Coordination mechanisms for selfish scheduling
• A heuristic for preemptive scheduling with set-up times
• Potential games
• Tradeoffs in worst-case equilibria
• Performance Guarantees of Local Search for Multiprocessor Scheduling
• A linear time approximation algorithm for multiprocessor scheduling
• Scheduling Independent Tasks on Uniform Processors
• The Price of Stability for Network Design with Fair Cost Allocation
• Tighter Bounds for LPT Scheduling on Uniform Processors
• Bounds for List Schedules on Uniform Processors
• Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
• A Better Heuristic for Preemptive Parallel Machine Scheduling with Batch Setup Times
• The Competitiveness of On-Line Assignments
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Über ein Paradoxon aus der Verkehrsplanung
• Bounds on Multiprocessing Timing Anomalies

This page was built for publication: Strategic Scheduling Games: Equilibria and Efficiency