A Unified Approach to Truthful Scheduling on Related Machines
提出了一个统一框架，用于设计相关机器上多种调度问题的确定性单调多项式时间近似方案，包括最小化最大完工时间、最大化最小负载等目标，并证明了存在多项式时间内可实现的诚实机制。
We present a unified framework for designing deterministic monotone polynomial time approximation schemes (PTASs) for a wide class of scheduling problems on uniformly related machines. This class includes (among others) minimizing the makespan, maximizing the minimum load, and minimizing the p-norm of the machine loads vector. Previously, this kind of result was only known for the makespan objective. Monotone algorithms have the property that an increase in the speed of a machine cannot decrease the amount of work assigned to it. Our results imply the existence of a truthful mechanism that can be implemented in polynomial time, where the social goal is approximated within arbitrary precision.