A Proof of the Nisan-Ronen Conjecture - An Overview
ACM SIGECOM EXCHANGES（2023）
Abstract
This note presents an overview of our recent publication, which validates a conjecture proposed by Nisan and Ronen in their seminal paper [Nisan and Ronen 2001]. We show that the optimal approximation ratio for deterministic truthful mechanisms for makespan-minimization by a set of n unrelated machines is n.
MoreTranslated text
Key words
Algorithmic mechanism design,Nisan-Ronen conjecture
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined