A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines

  • George Christodoulou
  • Annamária Kovács
  • Rob van Stee
Conference paper

DOI: 10.1007/978-3-642-17572-5_15

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)
Cite this paper as:
Christodoulou G., Kovács A., van Stee R. (2010) A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines. In: Saberi A. (eds) Internet and Network Economics. WINE 2010. Lecture Notes in Computer Science, vol 6484. Springer, Berlin, Heidelberg

Abstract

Designing truthful mechanisms for scheduling on related machines is a very important problem in single-parameter mechanism design. We consider the covering objective, that is we are interested in maximizing the minimum completion time of a machine. This problem falls into the class of problems where the optimal allocation can be truthfully implemented. A major open issue for this class is whether truthfulness affects the polynomial-time implementation.

We provide the first constant factor approximation for deterministic truthful mechanisms. In particular we come up with a 2 + ε approximation guarantee, significantly improving on the previous upper bound of min(m,(2+ε)sm/s1).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • George Christodoulou
    • 1
    • 3
  • Annamária Kovács
    • 2
  • Rob van Stee
    • 3
  1. 1.Cluster of Excellence “Multimodal Computing and Interaction”Saarland UniversitySaarbrückenGermany
  2. 2.Department of InformaticsGoethe UniversityFrankfurt am MainGermany
  3. 3.Max Planck Institute for InformaticsSaarbrückenGermany

Personalised recommendations