1 paper
Edith Cohen, Michal Feldman, Amos Fiat +2
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-…