In this work we give a tight lower bound on makespan approximation for envy-free allocation mechanisms dedicated to scheduling tasks on unrelated machines. Specifically, we show that no mechanism exists that can guarantee an envy-free allocation of jobs to m machines with a makespan less than a factor of O(logm) of the minimal makespan. Combined with previous results, this paper definitively proves that the optimal algorithm for obtaining a minimal makespan for any envy-free division can at best approximate the makespan to a factor of O(logm). © 2012 Springer-Verlag.
CITATION STYLE
Fiat, A., & Levavi, A. (2012). Tight lower bounds on envy-free makespan approximation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7695 LNCS, pp. 553–558). https://doi.org/10.1007/978-3-642-35311-6_46
Mendeley helps you to discover research relevant for your work.