A Unified Approach to Truthful Scheduling on Related Machines

Leah Epstein; Asaf Levin; Rob Van Stee

doi:10.1287/moor.2015.0730

A Unified Approach to Truthful Scheduling on Related Machines

Leah Epstein, Asaf Levin, Rob Van Stee

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	332-351
Number of pages	20
Journal	Mathematics of Operations Research
Volume	41
Issue number	1
DOIs	https://doi.org/10.1287/moor.2015.0730
State	Published - Feb 2016

Bibliographical note

Publisher Copyright:
© 2016 INFORMS.

Keywords

Algorithmic game theory
Monotone approximation algorithms
Scheduling

ASJC Scopus subject areas

General Mathematics
Computer Science Applications
Management Science and Operations Research

Access to Document

10.1287/moor.2015.0730

Cite this

@article{0834edb10dff4dcda8cce7f02b1de1af,

title = "A Unified Approach to Truthful Scheduling on Related Machines",

abstract = "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.",

keywords = "Algorithmic game theory, Monotone approximation algorithms, Scheduling",

author = "Leah Epstein and Asaf Levin and \{Van Stee\}, Rob",

note = "Publisher Copyright: {\textcopyright} 2016 INFORMS.",

year = "2016",

month = feb,

doi = "10.1287/moor.2015.0730",

language = "English",

volume = "41",

pages = "332--351",

journal = "Mathematics of Operations Research",

issn = "0364-765X",

publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",

number = "1",

}

TY - JOUR

T1 - A Unified Approach to Truthful Scheduling on Related Machines

AU - Epstein, Leah

AU - Levin, Asaf

AU - Van Stee, Rob

PY - 2016/2

Y1 - 2016/2

N2 - 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.

AB - 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.

KW - Algorithmic game theory

KW - Monotone approximation algorithms

KW - Scheduling

UR - https://www.scopus.com/pages/publications/84959311487

U2 - 10.1287/moor.2015.0730

DO - 10.1287/moor.2015.0730

M3 - Article

AN - SCOPUS:84959311487

SN - 0364-765X

VL - 41

SP - 332

EP - 351

JO - Mathematics of Operations Research

JF - Mathematics of Operations Research

IS - 1

ER -

A Unified Approach to Truthful Scheduling on Related Machines

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this