关于Nisan-Ronen猜想
On the Nisan-Ronen conjecture
摘要：
Nisan-Ronen猜想指出，当将$m$任务分配给$n$不相关的机器时，没有真实的最小化完工时间的机制可以具有小于$n$的近似比。自它提出以来的二十多年里，在解决它方面取得的进展很少，最著名的下界仍然是一个小常数。通过给出$1+\sqrt{n-1}$的下界，进一步验证了该猜想.
英文摘要：
The Nisan-Ronen conjecture states that no truthful mechanism for makespan-minimization when allocating $m$ tasks to $n$ unrelated machines can have approximation ratio less than $n$. Over more than two decades since its formulation, little progress has been made in resolving it and the best known lower bound is still a small constant. This work makes progress towards validating the conjecture by showing a lower bound of $1+\sqrt{n-1}$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
