Output details
11 - Computer Science and Informatics
University of Liverpool
Return to search
Output 0 of 0 in the submission
Article title
A Deterministic Truthful PTAS for Scheduling Related Machines
Type
D - Journal article
Title of journal
SIAM Journal on Computing
Article number
-
Volume number
42
Issue number
4
First page of article
1572
ISSN of journal
1095-7111
Year of publication
2013
URL
-
Number of additional authors
1
Additional information
<12>We give a conclusive answer to an open problem in Algorithmic Mechanism Design. This problem was first studied over 10 years ago by Archer and Tardos [FOCS 2001], and since then received significant attention. We provide a deterministic truthful PTAS that is provably the best possible. Building on our techniques, Epstein et al. [SODA 2013] extended the results to other objectives. A preliminary version of this paper appeared in SODA 2010.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
