Cohen, Edith; Feldman, Michal; Fiat, Amos; Kaplan, Haim; … - Center for the Study of Rationality, Hebrew University … - 2010
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(logm), where m is the number of...