Deterministic monotone algorithms for scheduling on related machines

We consider the problem of designing monotone deterministic algorithms for scheduling tasks on related machines in order to minimize the makespan. Several recent papers showed that monotonicity is a fundamental property to design truthful mechanisms for this scheduling problem. We give both theoreti...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 406; no. 3; pp. 173 - 186
Main Authors:	Ambrosio, Pasquale, Auletta, Vincenzo
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 31.10.2008
Subjects:	Algorithmic mechanism design Monotone algorithms Scheduling Algorithmic mechanism design Monotone algorithms Scheduling
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!