Toggle navigation
OpenReview
.net
Login
×
Go to
DBLP
homepage
A Proof of the Nisan-Ronen Conjecture
George Christodoulou
,
Elias Koutsoupias
,
Annamária Kovács
Published: 01 Jan 2023, Last Modified: 15 Jul 2024
STOC 2023
Everyone
Revisions
BibTeX
CC BY-SA 4.0
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.
Loading