Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines

We study problems of scheduling jobs on related machines so as to minimize the makespan in the setting where machines are strategic agents. In this problem, each job j has a length lj and each machine i has a private speed ti. The running time of job j on machine i is tilj. We seek a mechanism that obtains speed bids of machines and then assign jobs and payments to machines so that the machines have incentive to report true speeds and the allocation and payments are also envy-free. We show that

• Type: Journal
• Year: 2011
• Where: CORR
• Authors: Lisa Fleischer, Zhenghui Wang
• Keywords: CORR 2011, Education, Length Lj, Machines, Private Speed Ti