The temp secretary problem

Amos Fiat; Ilia Gorelik; Haim Kaplan; Slava Novgorodov

doi:10.1007/978-3-662-48350-3_53

The temp secretary problem

Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov

Tel Aviv University

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

Abstract

We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration γ. This models online hiring of temporary employees, or online auctions for re-usable resources. The problem is related to the question of finding a large independent set in a random unit interval graph.

Original language	English
Title of host publication	Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings
Editors	Nikhil Bansal, Irene Finocchi
Publisher	Springer Verlag
Pages	631-642
Number of pages	12
ISBN (Print)	9783662483497
DOIs	https://doi.org/10.1007/978-3-662-48350-3_53
State	Published - 2015
Event	23rd European Symposium on Algorithms, ESA 2015 - Patras, Greece Duration: 14 Sep 2015 → 16 Sep 2015

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	9294

Conference

Conference	23rd European Symposium on Algorithms, ESA 2015
Country/Territory	Greece
City	Patras
Period	14/09/15 → 16/09/15

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-48350-3_53

Cite this

Fiat, A., Gorelik, I., Kaplan, H., & Novgorodov, S. (2015). The temp secretary problem. In N. Bansal, & I. Finocchi (Eds.), Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings (pp. 631-642). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9294). Springer Verlag. https://doi.org/10.1007/978-3-662-48350-3_53

@inproceedings{3bb8c0d928af46cc87b1d9ea91ea0dbe,

title = "The temp secretary problem",

abstract = "We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration γ. This models online hiring of temporary employees, or online auctions for re-usable resources. The problem is related to the question of finding a large independent set in a random unit interval graph.",

author = "Amos Fiat and Ilia Gorelik and Haim Kaplan and Slava Novgorodov",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2015.; 23rd European Symposium on Algorithms, ESA 2015 ; Conference date: 14-09-2015 Through 16-09-2015",

year = "2015",

doi = "10.1007/978-3-662-48350-3\_53",

language = "الإنجليزيّة",

isbn = "9783662483497",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "631--642",

editor = "Nikhil Bansal and Irene Finocchi",

booktitle = "Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings",

address = "ألمانيا",

}

Fiat, A, Gorelik, I, Kaplan, H & Novgorodov, S 2015, The temp secretary problem. in N Bansal & I Finocchi (eds), Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 9294, Springer Verlag, pp. 631-642, 23rd European Symposium on Algorithms, ESA 2015, Patras, Greece, 14/09/15. https://doi.org/10.1007/978-3-662-48350-3_53

The temp secretary problem. / Fiat, Amos; Gorelik, Ilia; Kaplan, Haim et al.
Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. ed. / Nikhil Bansal; Irene Finocchi. Springer Verlag, 2015. p. 631-642 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9294).

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

TY - GEN

T1 - The temp secretary problem

AU - Fiat, Amos

AU - Gorelik, Ilia

AU - Kaplan, Haim

AU - Novgorodov, Slava

PY - 2015

Y1 - 2015

N2 - We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration γ. This models online hiring of temporary employees, or online auctions for re-usable resources. The problem is related to the question of finding a large independent set in a random unit interval graph.

AB - We consider a generalization of the secretary problem where contracts are temporary, and for a fixed duration γ. This models online hiring of temporary employees, or online auctions for re-usable resources. The problem is related to the question of finding a large independent set in a random unit interval graph.

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

U2 - 10.1007/978-3-662-48350-3_53

DO - 10.1007/978-3-662-48350-3_53

M3 - منشور من مؤتمر

SN - 9783662483497

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 631

EP - 642

BT - Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings

A2 - Bansal, Nikhil

A2 - Finocchi, Irene

PB - Springer Verlag

T2 - 23rd European Symposium on Algorithms, ESA 2015

Y2 - 14 September 2015 through 16 September 2015

ER -

Fiat A, Gorelik I, Kaplan H, Novgorodov S. The temp secretary problem. In Bansal N, Finocchi I, editors, Algorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings. Springer Verlag. 2015. p. 631-642. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-48350-3_53

The temp secretary problem

Abstract

Publication series

Conference

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this