A Proof of the Nisan-Ronen Conjecture

George Christodoulou,Elias Koutsoupias,Annamaria Kovacs

PROCEEDINGS OF THE 55TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2023（2023）

引用 1|浏览22

暂无评分

摘要

Noam Nisan and Amir Ronen conjectured that the best approximation ratio of deterministic truthful mechanisms for makespanminimization for.. unrelated machines is n This work validates the conjecture.

查看译文

关键词

Nisan-Ronen conjecture,incentive compatible scheduling

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要