2000 character limit reached
A proof of the Nisan-Ronen conjecture
Published 27 Jan 2023 in cs.GT | (2301.11905v1)
Abstract: Noam Nisan and Amir Ronen conjectured that the best approximation ratio of deterministic truthful mechanisms for makespan-minimization for $n$ unrelated machines is $n$. This work validates the conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.