Truthfulness for the Sum of Weighted Completion Times

DOI10.1007/978-3-319-42634-1_2zbMath1476.68305OpenAlexW2502785933MaRDI QIDQ2817845

Fanny Pascual, Nicolas Thibault, Eric Angel, Evripidis Bampis

Publication date: 2 September 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-42634-1_2

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items

Implementation of optimal schedules in outsourcing with identical suppliers

Cites Work

• Unnamed Item
• Randomized truthful algorithms for scheduling selfish tasks on parallel machines
• Truthful algorithms for scheduling selfish tasks on parallel machines
• On truthfulness and approximation for scheduling selfish tasks
• Scheduling tasks from selfish multi-tasks agents
• Algorithmic mechanism design (extended abstract)
• The Price of Anarchy for Minsum Related Machine Scheduling
• Optimal Coordination Mechanisms for Multi-job Scheduling Games
• Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
• Worst Case Bound of an LRF Schedule for the Mean Weighted Flow-Time Problem
• Incentives in Teams
• Scheduling Unrelated Machines by Randomized Rounding
• Inner product spaces for MinSum coordination mechanisms
• STACS 2005
• Approximation and Online Algorithms