Answers are grounded in this paper and cite their sources.
We show that the best approximation ratio of deterministic truthful mechanisms for makespan-minimization for n unrelated machines is n , as it was conjectured by Noam Nisan and Amir Ronen.
No takes yet. Share an insight, caveat, or question.
Christodoulou et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: