de.mpg.escidoc.pubman.appbase.FacesBean
Deutsch
 
Hilfe Wegweiser Impressum Kontakt Einloggen
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

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

MPG-Autoren
http://pubman.mpdl.mpg.de/cone/persons/resource/persons45543

van Stee,  Rob
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine Externen Ressourcen verfügbar
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Christodoulou, G., Kovacs, A., & van Stee, R. (2013). A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines. Theoretical Computer Science, 489-490, 88-98. doi:10.1016/j.tcs.2013.04.003.


Zitierlink: http://hdl.handle.net/11858/00-001M-0000-0015-3BC4-F
Zusammenfassung
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 approximation guarantee of 2+\eps, significantly improving on the previous upper bound of \min(m,(2+\eps)s_m/s_1).