The Temp Secretary Problem
Data Structures and Algorithms
2015-07-09 v2
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.
Cite
@article{arxiv.1507.01732,
title = {The Temp Secretary Problem},
author = {Amos Fiat and Ilia Gorelik and Haim Kaplan and Slava Novgorodov},
journal= {arXiv preprint arXiv:1507.01732},
year = {2015}
}