The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
Envy-Free Makespan Approximation
[article]
2009
arXiv
pre-print
We study envy-free mechanisms for scheduling tasks on unrelated machines (agents) that approximately minimize the makespan. For indivisible tasks, we put forward an envy-free poly-time mechanism that approximates the minimal makespan to within a factor of O( m), where m is the number of machines. We also show a lower bound of Ω( m / m). This improves the recent result of Hartline et al.Ahuva:2008 who give an upper bound of (m+1)/2, and a lower bound of 2-1/m. For divisible tasks, we show that
arXiv:0909.1072v1
fatcat:mmgzfqksxbgtjn4azrsiu5n4ti