Envy-Free Makespan Approximation

Details Envy-Free Makespan Approximation Envy-Free Makespan Approximation

2009-09-06

arxiv.org/abs/0909.1072v1

Computer Science

Computer Science and Game Theory

Scientific paper

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(\log m)$, where $m$ is the number of machines. We also show a lower bound of $\Omega(\log m / \log\log m)$. This improves the recent result of Hartline {\sl et al.} \cite{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 there always exists an envy-free poly-time mechanism with optimal makespan.

Affiliated with

Also associated with

No associations

Rating

Envy-Free Makespan Approximation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Envy-Free Makespan Approximation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Envy-Free Makespan Approximation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-723669