The temp secretary problem

Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationAlgorithms – ESA 2015 - 23rd Annual European Symposium, Proceedings
EditorsNikhil Bansal, Irene Finocchi
PublisherSpringer Verlag
Pages631-642
Number of pages12
ISBN (Print)9783662483497
DOIs
StatePublished - 2015
Event23rd European Symposium on Algorithms, ESA 2015 - Patras, Greece
Duration: 14 Sep 201516 Sep 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9294
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd European Symposium on Algorithms, ESA 2015
Country/TerritoryGreece
CityPatras
Period14/09/1516/09/15

Fingerprint

Dive into the research topics of 'The temp secretary problem'. Together they form a unique fingerprint.

Cite this