TL;DR该论文探讨了两种调度机制(K 和 P 机制)的性能,证明了 K 机制是优于 P 机制的,并在特定条件下给出了它们的平均近似比例收敛值。
Abstract
The problem of scheduling unrelated machines has been studied since the
inception of algorithmic mechanism design \cite{NR99}. It is a resource
allocation problem that entails assigning $m$ tasks to $n$ machines