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 | |
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 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 23rd European Symposium on Algorithms, ESA 2015 |
---|---|
Country/Territory | Greece |
City | Patras |
Period | 14/09/15 → 16/09/15 |