monotone_PTAS_MOR_revised5-1.pdf (295.98 kB)
Download file

A Unified Approach to Truthful Scheduling on Related Machines

Download (295.98 kB)
journal contribution
posted on 18.04.2016, 09:33 by Rob Van Stee, L. Epstein, A. Levin
We present a unified framework for designing deterministic monotone polynomial time approximation schemes (PTASs) for a wide class of scheduling problems on uniformly related machines. This class includes (among others) minimizing the makespan, maximizing the minimum load, and minimizing the p-norm of the machine loads vector. Previously, this kind of result was only known for the makespan objective. Monotone algorithms have the property that an increase in the speed of a machine cannot decrease the amount of work assigned to it. Our results imply the existence of a truthful mechanism that can be implemented in polynomial time, where the social goal is approximated within arbitrary precision.

History

Citation

Mathematics of Operations Research, 2016, 41 (1), pp. 332-351 (20)

Author affiliation

/Organisation/COLLEGE OF SCIENCE AND ENGINEERING/Department of Computer Science

Version

AM (Accepted Manuscript)

Published in

Mathematics of Operations Research

Publisher

INFORMS (Institute for Operations Research and Management Sciences)

issn

0364-765X

eissn

1526-5471

Acceptance date

03/03/2015

Available date

22/12/2016

Publisher version

http://pubsonline.informs.org/doi/10.1287/moor.2015.0730

Notes

The file associated with this record is under a 12-month embargo from publication in accordance with the publisher's self-archiving policy. The full text may be available through the publisher links provided above.

Language

en