Tight Lower Bounds on Envy-Free Makespan Approximation

  title={Tight Lower Bounds on Envy-Free Makespan Approximation},
  author={Amos Fiat and Ariel Levavi},
In this work we give a tight lower bound on makespan approximations for envy-free allocation mechanism 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 of 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… CONTINUE READING

From This Paper

Topics from this paper.
1 Citations
14 References
Similar Papers