collaborators

1 paper

cs.GT2011

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

Lisa Fleischer, Zhenghui Wang

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 has a leng…