2015/07/07 by Amos Fiat, Ilia Gorelik, Fiat, Amos +5 · 1 voice
Computer Science · Decision Sciences · #68Q25 #Advanced Bandit Algorithms Research #Auction Theory and Applications #Data Structures and Algorithms (cs.DS) #F.2.2 #FOS: Computer and information sciences #Optimization and Search Problems #acm:68Q25 #cs.DS #msc:68Q25
paper · pdf · doi:10.48550/arxiv.1507.01732
openalex publication_date 2015/07/07 · arxiv published 2015/07/07 · arxiv created 2015/07/08 · arxiv updated 2015/07/09 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.