Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
From MaRDI portal
Publication:2140265
DOI10.1016/j.ejor.2021.11.047zbMath1506.90093OpenAlexW3215124398MaRDI QIDQ2140265
Dirk Briskorn, Stefan Waldherr
Publication date: 20 May 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.11.047
Cites Work
- Unnamed Item
- Coordination mechanisms
- Coordination mechanisms for selfish scheduling
- Minimizing the number of tardy jobs for \(m\) parallel machines
- Minimizing the weighted number of tardy jobs on parallel processors
- Coordination mechanisms for parallel machine scheduling
- Efficient coordination mechanisms for unrelated machine scheduling
- Approximating the Throughput of Multiple Machines in Real-Time Scheduling
- The Price of Anarchy for Minsum Related Machine Scheduling
- Mechanism Design for Decentralized Online Machine Scheduling
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling
- Algorithms for Scheduling Independent Tasks
- Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Solving Parallel Machine Scheduling Problems by Column Generation
- HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS
- The Price of Anarchy in Auctions
- Inner product spaces for MinSum coordination mechanisms
- Algorithmic Game Theory
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Bounds for Certain Multiprocessing Anomalies
- Scheduling
- Algorithmic mechanism design
