HackerPapers

arXiv:1507.01732cs.DS

The Temp Secretary Problem

Amos Fiat, Ilia Gorelik, Haim Kaplan, Slava Novgorodov

Early discovery. Linked by one identifiable commenter. This paper is outside the main ranking; a mention is not an endorsement.

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.

arXiv comments
Journal reference
DOI
Subjects
cs.DSData Structures and Algorithms

On Hacker News

Linked by 1 identifiable commenter in 1 comment across 1 thread, from Mar 2016 to Mar 2016. Found in 1 HN submission from Jul 2015 to Jul 2015. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments1 thread

  1. Secretary Problem 1 comment

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.