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

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 406; číslo 3; s. 173 - 186
Hlavní autori:	Ambrosio, Pasquale, Auletta, Vincenzo
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 31.10.2008
Predmet:	Algorithmic mechanism design Monotone algorithms Scheduling Algorithmic mechanism design Monotone algorithms Scheduling
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!