A Proof of the Nisan-Ronen Conjecture
George Christodoulou, Elias Koutsoupias, Annamária Kovács
2023年份
10被引次数
3顶会引用
摘要
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
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper3
- Mechanism design augmented with output adviceGeorge Christodoulou, Alkmini Sgouritsa, Ioannis VlachosNeurIPS 2024 · 被引用 22 次
- Proportionally Fair Makespan ApproximationMichal Feldman, Jugal Garg, Vishnu V. Narayan, Tomasz PonitkaAAAI 2025 · 被引用 2 次
- Parsimonious Predictions for Strategyproof SchedulingRichard Cole, Anupam Gupta, Pranav JangirNeurIPS 2025 · 被引用 2 次
它引用的顶会 Paper2
相关 Paper
- Santa Claus meets Makespan and Matroids: Algorithms and ReductionsÉtienne Bamas, Alexander Lindermayr, Nicole Megow, Lars Rohwedder 等SODA 2024 · 被引用 3 次
- Efficient Truthful Scheduling and Resource Allocation through MonitoringDimitris Fotakis, Piotr Krysta, Carmine VentreAAAI 2021 · 被引用 2 次
- Truthful Mechanisms for Steiner Tree ProblemsJinshan Zhang, Zhengyang Liu, Xiaotie Deng, Jianwei YinAAAI 2023 · 被引用 1 次
- 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 次
