The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design
Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2013), The Lazy Bureaucrat Problem with Common Arrivals and Deadlines: Approximation and Mechanism Design, in Gąsieniec, Leszek Antoni; Wolter, Frank, Fundamentals of Computation Theory, Springer : Berlin Heidelberg, p. 171-182. 10.1007/978-3-642-40164-0_18
Type
Communication / ConférenceDate
2013Conference title
19th International Symposium, FCT 2013Conference date
2013-08Conference city
LiverpoolConference country
United KingdomBook title
Fundamentals of Computation TheoryBook author
Gąsieniec, Leszek Antoni; Wolter, FrankPublisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-642-40163-3
Number of pages
316Pages
171-182
Publication identifier
Metadata
Show full item recordAuthor(s)
Gourvès, LaurentLaboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Monnot, Jérôme

Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Pagourtzis, Aris T.
School of Electrical and Computer Engineering, National Technical University of Athens [ICCS]
Abstract (EN)
We study the Lazy Bureaucrat scheduling problem (Arkin, Bender, Mitchell and Skiena [1]) in the case of common arrivals and deadlines. In this case the goal is to select a subset of given jobs in such a way that the total processing time is minimized and no other job can fit into the schedule. Our contribution comprises a linear time 4/3-approximation algorithm and an FPTAS, which respectively improve on a linear time 2-approximation algorithm and a PTAS given for the more general case of common deadlines [2,3]. We then consider a selfish perspective, in which jobs are submitted by players who may falsely report larger processing times, and show a tight upper bound of 2 on the approximation ratio of strategyproof mechanisms, even randomized ones. We conclude by introducing a maximization version of the problem and a dedicated greedy algorithm.Subjects / Keywords
optimisation combinatoireRelated items
Showing items related by title and author.
-
Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2014) Communication / Conférence
-
Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2013) Communication / Conférence
-
Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris (2019) Communication / Conférence
-
Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris (2022) Article accepté pour publication ou publié
-
Monnot, Jérôme; Gourvès, Laurent; Escoffier, Bruno (2010) Article accepté pour publication ou publié