A proof of the Nisan-Ronen conjecture
Computer Science and Game Theory
2023-01-30 v1
Abstract
Noam Nisan and Amir Ronen conjectured that the best approximation ratio of deterministic truthful mechanisms for makespan-minimization for unrelated machines is . This work validates the conjecture.
Keywords
Cite
@article{arxiv.2301.11905,
title = {A proof of the Nisan-Ronen conjecture},
author = {George Christodoulou and Elias Koutsoupias and Annamaria Kovacs},
journal= {arXiv preprint arXiv:2301.11905},
year = {2023}
}