Strategic scheduling games: equilibria and efficiency
From MaRDI portal
Publication:2958675
DOI10.1007/978-1-4614-1123-9_10zbMATH Open1355.91002OpenAlexW1988254830MaRDI QIDQ2958675FDOQ2958675
Jérôme Monnot, Orestis A. Telelis, Laurent Gourvès
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
Recommendations
Deterministic scheduling theory in operations research (90B35) Applications of game theory (91A80) Noncooperative games (91A10)
Cites Work
- Über ein Paradoxon aus der Verkehrsplanung
- Potential games
- The Price of Stability for Network Design with Fair Cost Allocation
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- The Competitiveness of On-Line Assignments
- Bounds on Multiprocessing Timing Anomalies
- Approximation algorithms for scheduling unrelated parallel machines
- Scheduling Independent Tasks on Uniform Processors
- Tighter Bounds for LPT Scheduling on Uniform Processors
- Coordination mechanisms for selfish scheduling
- 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
- Truthful algorithms for scheduling selfish tasks on parallel machines
- Acceptable points in games of perfect information
- Performance guarantees of local search for multiprocessor scheduling
- A linear time approximation algorithm for multiprocessor scheduling
- Tradeoffs in worst-case equilibria
- A heuristic for preemptive scheduling with set-up times
- Lot-sizing scheduling with batch setup times
Cited In (4)
This page was built for publication: Strategic scheduling games: equilibria and efficiency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958675)