Reproduce “Sharp Bounds for Truthful-in-Expectation Scheduling” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Yunpeng Li
The paper presents a randomized mechanism for unrelated-machine scheduling that is truthful in expectation. It keeps each job’s probabilities while correlating assignments across jobs to reduce peak load. For every n≥7, the optimal approximation ratio is (n+1)/2, including a ratio of 4 for seven machines. This bound applies to mechanisms with finite payments and a uniform guarantee across finite job counts.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.