A deterministic truthful PTAS for scheduling related machines

George Christodoulou, Annamaria Kovacs

Scheduling on related machines ($Q||C_{\max }$) is one of the most important problems in the field of Algorithmic Mechanism Design. Each machine is controlled by a selfish agent and…