Mechanism Design for Fractional Scheduling on Unrelated Machines

  • George Christodoulou
  • Elias Koutsoupias
  • Annamária Kovács
Conference paper

DOI: 10.1007/978-3-540-73420-8_6

Volume 4596 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Christodoulou G., Koutsoupias E., Kovács A. (2007) Mechanism Design for Fractional Scheduling on Unrelated Machines. In: Arge L., Cachin C., Jurdziński T., Tarlecki A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg

Abstract

In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fractional truthful mechanism, while we propose a truthful mechanism that achieves approximation of 1 + (n − 1)/2, for n machines. We also focus on an interesting family of allocation algorithms, the task-independent algorithms. We give a lower bound of 1 + (n − 1)/2, that holds for every (not only monotone) allocation algorithm of this class. Under this consideration, our truthful independent mechanism is the best that we can hope from this family of algorithms.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • George Christodoulou
    • 1
  • Elias Koutsoupias
    • 2
  • Annamária Kovács
    • 1
  1. 1.Max-Planck-Institut für Informatik, SaarbrückenGermany
  2. 2.Department of Informatics, University of Athens