A Unified Approach to Truthful Scheduling on Related Machines

Leah Epstein, Asaf Levin, Rob Van Stee

Research output: Contribution to journalArticlepeer-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 languageAmerican English
Pages (from-to)332-351
Number of pages20
JournalMathematics of Operations Research
Volume41
Issue number1
DOIs
StatePublished - Feb 2016

Keywords

  • Algorithmic game theory
  • Monotone approximation algorithms
  • Scheduling

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • General Mathematics
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'A Unified Approach to Truthful Scheduling on Related Machines'. Together they form a unique fingerprint.

Cite this