Truthful approximation schemes for single-parameter agents
Cached
Download Links
- [theory.stanford.edu]
- [www.cs.stanford.edu]
- [www.cs.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- [theory.stanford.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In FOCS ’08 |
| Citations: | 22 - 8 self |
BibTeX
@INPROCEEDINGS{Dhangwatnotai_truthfulapproximation,
author = {Peerapong Dhangwatnotai and Shahar Dobzinski and Shaddin Dughmi and Tim Roughgarden},
title = {Truthful approximation schemes for single-parameter agents},
booktitle = {In FOCS ’08},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We present the first monotone randomized polynomial-time approximation scheme (PTAS) for minimizing the makespan of parallel related machines (Q||Cmax), the paradigmatic problem in single-parameter algorithmic mechanism design. This result immediately gives a polynomialtime, truthful (in expectation) mechanism whose approximation guarantee attains the bestpossible one for all polynomial-time algorithms (assuming P ̸ = NP). Our algorithmic techniques are flexible and also yield a monotone deterministic quasi-PTAS for Q||Cmax and a monotone randomized PTAS for max-min scheduling on related machines. 1
