• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - Request a copy

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érence
Date
2013
Conference title
19th International Symposium, FCT 2013
Conference date
2013-08
Conference city
Liverpool
Conference country
United Kingdom
Book title
Fundamentals of Computation Theory
Book author
Gąsieniec, Leszek Antoni; Wolter, Frank
Publisher
Springer
Published in
Berlin Heidelberg
ISBN
978-3-642-40163-3
Number of pages
316
Pages
171-182
Publication identifier
10.1007/978-3-642-40164-0_18
Metadata
Show full item record
Author(s)
Gourvès, Laurent
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Monnot, Jérôme cc
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 combinatoire
JEL
C44 - Operations Research; Statistical Decision Theory

Related items

Showing items related by title and author.

  • Thumbnail
    The Lazy Matroid Problem 
    Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2014) Communication / Conférence
  • Thumbnail
    Algorithmes et mécanismes pour bureaucrates paresseux 
    Gourvès, Laurent; Monnot, Jérôme; Pagourtzis, Aris T. (2013) Communication / Conférence
  • Thumbnail
    Extension and its price for the connected vertex cover problem 
    Khosravian Ghadikolaei, Mehdi; Melissinos, Nikolaos; Monnot, Jérôme; Pagourtzis, Aris (2019) Communication / Conférence
  • Thumbnail
    Complexity and Approximation Results for the Connected Vertex Cover Problem in Graphs and Hypergraphs 
    Monnot, Jérôme; Gourvès, Laurent; Escoffier, Bruno (2010) Article accepté pour publication ou publié
  • Thumbnail
    Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs 
    Escoffier, Bruno; Gourvès, Laurent; Monnot, Jérôme (2007) Document de travail / Working paper
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo