A New Lower Bound for Deterministic Truthful Scheduling

Yiannis Giannakopoulos, Alexander Hammerl, Diogo Poças

We study the problem of truthfully scheduling $m$ tasks to $n$ selfish unrelated machines, under the objective of makespan minimization, as was introduced in the seminal work of Ni…