Well-behaved online load balancing against strategic jobs
From MaRDI portal
Publication:6090218
DOI10.1007/s10951-022-00770-6zbMath1527.90105arXiv1909.04481MaRDI QIDQ6090218
Publication date: 14 November 2023
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.04481
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A lower bound for scheduling mechanisms
- Scheduling on identical machines: How good is LPT in an on-line setting?
- A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
- A Unified Approach to Truthful Scheduling on Related Machines
- Algorithmic mechanism design (extended abstract)
- A Deterministic Truthful PTAS for Scheduling Related Machines
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- On-Line Load Balancing for Related Machines
- Algorithmic Game Theory
- Algorithms – ESA 2005
- Bounds on Multiprocessing Timing Anomalies
- STACS 2005
- An optimal online algorithm for scheduling two machines with release times