A Proof of the Nisan-Ronen Conjecture
George Christodoulou, Elias Koutsoupias, Annamária Kovács
2023Year
10Citations
3Top-tier citations
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext ae78694f-45e4-4301-aa95-25192240dc3cCited by top-tier papers3
- Mechanism design augmented with output adviceGeorge Christodoulou, Alkmini Sgouritsa, Ioannis VlachosNeurIPS 2024 · 22 citations
- Proportionally Fair Makespan ApproximationMichal Feldman, Jugal Garg, Vishnu V. Narayan, Tomasz PonitkaAAAI 2025 · 2 citations
- Parsimonious Predictions for Strategyproof SchedulingRichard Cole, Anupam Gupta, Pranav JangirNeurIPS 2025 · 2 citations
Builds on2
Related papers
- Santa Claus meets Makespan and Matroids: Algorithms and ReductionsÉtienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder et al.SODA 2024 · 3 citations
- Efficient Truthful Scheduling and Resource Allocation through MonitoringDimitris Fotakis, Piotr Krysta, Carmine VentreAAAI 2021 · 2 citations
- Truthful Mechanisms for Steiner Tree ProblemsJinshan Zhang, Zhengyang Liu, Xiaotie Deng, Jianwei YinAAAI 2023 · 1 citation
- Settling the Maximin Share Fairness for Scheduling among Groups of MachinesBo Li, Fangxiao Wang, Shiji XingICML 2025
- Settling the Communication Complexity of VCG-Based Mechanisms for All Approximation GuaranteesFrederick V. Qiu, S. Matthew WeinbergSTOC 2024 · 1 citation
