A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Envy-free makespan approximation
2010
Proceedings of the 11th ACM conference on Electronic commerce - EC '10
We study envy-free mechanisms for assigning tasks to agents, where every task may take a different amount of time to perform by each agent, and the goal is to get all the tasks done as soon as possible (i.e., minimize the makespan). For indivisible tasks, we put forward an envy-free polynomial mechanism that approximates the minimal makespan to within a factor of O(log m), where m is the number of machines. This bound is almost tight, as we also show that no envy-free mechanism can achieve a
doi:10.1145/1807342.1807368
dblp:conf/sigecom/CohenFFKO10
fatcat:3sichpvspjcapbrpbtafxv3bce