Truthful prompt scheduling for minimizing sum of completion times

Alon Eden; Michal Feldman; Amos Fiat; Tzahi Taub

doi:10.4230/LIPIcs.ESA.2018.27

Truthful prompt scheduling for minimizing sum of completion times

Alon Eden, Michal Feldman, Amos Fiat, Tzahi Taub

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

We give a prompt online mechanism for minimizing the sum of [weighted] completion times. This is the first prompt online algorithm for the problem. When such jobs are strategic agents, delaying scheduling decisions makes little sense. Moreover, the mechanism has a particularly simple form of an anonymous menu of options.

Original language	English
Title of host publication	26th European Symposium on Algorithms, ESA 2018
Editors	Hannah Bast, Grzegorz Herman, Yossi Azar
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Print)	9783959770811
DOIs	https://doi.org/10.4230/LIPIcs.ESA.2018.27
State	Published - 1 Aug 2018
Externally published	Yes
Event	26th European Symposium on Algorithms, ESA 2018 - Helsinki, Finland Duration: 20 Aug 2018 → 22 Aug 2018

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	112
ISSN (Print)	1868-8969

Conference

Conference	26th European Symposium on Algorithms, ESA 2018
Country/Territory	Finland
City	Helsinki
Period	20/08/18 → 22/08/18

Bibliographical note

Publisher Copyright:
© Alon Eden, Michal Feldman, Amos Fiat, and Tzahi Taub.

Keywords

Mechanism design
Online algorithms
Scheduling

Access to Document

10.4230/LIPIcs.ESA.2018.27

Cite this

Eden, A., Feldman, M., Fiat, A., & Taub, T. (2018). Truthful prompt scheduling for minimizing sum of completion times. In H. Bast, G. Herman, & Y. Azar (Eds.), 26th European Symposium on Algorithms, ESA 2018 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 112). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ESA.2018.27

@inproceedings{8a30ee0fe14f4e288f8a98d3bd2ae998,

title = "Truthful prompt scheduling for minimizing sum of completion times",

abstract = "We give a prompt online mechanism for minimizing the sum of [weighted] completion times. This is the first prompt online algorithm for the problem. When such jobs are strategic agents, delaying scheduling decisions makes little sense. Moreover, the mechanism has a particularly simple form of an anonymous menu of options.",

keywords = "Mechanism design, Online algorithms, Scheduling",

author = "Alon Eden and Michal Feldman and Amos Fiat and Tzahi Taub",

note = "Publisher Copyright: {\textcopyright} Alon Eden, Michal Feldman, Amos Fiat, and Tzahi Taub.; 26th European Symposium on Algorithms, ESA 2018 ; Conference date: 20-08-2018 Through 22-08-2018",

year = "2018",

month = aug,

day = "1",

doi = "10.4230/LIPIcs.ESA.2018.27",

language = "אנגלית",

isbn = "9783959770811",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Hannah Bast and Grzegorz Herman and Yossi Azar",

booktitle = "26th European Symposium on Algorithms, ESA 2018",

address = "גרמניה",

}

Eden, A, Feldman, M, Fiat, A & Taub, T 2018, Truthful prompt scheduling for minimizing sum of completion times. in H Bast, G Herman & Y Azar (eds), 26th European Symposium on Algorithms, ESA 2018. Leibniz International Proceedings in Informatics, LIPIcs, vol. 112, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 26th European Symposium on Algorithms, ESA 2018, Helsinki, Finland, 20/08/18. https://doi.org/10.4230/LIPIcs.ESA.2018.27

Truthful prompt scheduling for minimizing sum of completion times. / Eden, Alon; Feldman, Michal; Fiat, Amos et al.
26th European Symposium on Algorithms, ESA 2018. ed. / Hannah Bast; Grzegorz Herman; Yossi Azar. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 112).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Truthful prompt scheduling for minimizing sum of completion times

AU - Eden, Alon

AU - Feldman, Michal

AU - Fiat, Amos

AU - Taub, Tzahi

PY - 2018/8/1

Y1 - 2018/8/1

N2 - We give a prompt online mechanism for minimizing the sum of [weighted] completion times. This is the first prompt online algorithm for the problem. When such jobs are strategic agents, delaying scheduling decisions makes little sense. Moreover, the mechanism has a particularly simple form of an anonymous menu of options.

AB - We give a prompt online mechanism for minimizing the sum of [weighted] completion times. This is the first prompt online algorithm for the problem. When such jobs are strategic agents, delaying scheduling decisions makes little sense. Moreover, the mechanism has a particularly simple form of an anonymous menu of options.

KW - Mechanism design

KW - Online algorithms

KW - Scheduling

UR - http://www.scopus.com/inward/record.url?scp=85052516927&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.ESA.2018.27

DO - 10.4230/LIPIcs.ESA.2018.27

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85052516927

SN - 9783959770811

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 26th European Symposium on Algorithms, ESA 2018

A2 - Bast, Hannah

A2 - Herman, Grzegorz

A2 - Azar, Yossi

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 26th European Symposium on Algorithms, ESA 2018

Y2 - 20 August 2018 through 22 August 2018

ER -

Truthful prompt scheduling for minimizing sum of completion times

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this