Hiring Secretaries over Time: The Benefit of Concurrent Employment
DOI10.1287/moor.2019.0993zbMath1444.60032arXiv1604.08125OpenAlexW2970334180WikidataQ127280538 ScholiaQ127280538MaRDI QIDQ5108268
Daniel Schmand, Martin Gairing, Andreas Tönnis, John Fearnley, Max Klimm, Yann Disser, Oliver Göbel, Alexander Skopalik
Publication date: 30 April 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.08125
Markov processesMarkov chainonline algorithmsecretary problemprophet inequalitystopping problemcomputers/computer science, analysis of algorithms
Analysis of algorithms (68W40) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15) Online algorithms; streaming algorithms (68W27)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The asymptotic behavior of the reward sequence in the optimal stopping of i.i.d. random variables
- Comparison of threshold stop rules and maximum for independent nonnegative random variables
- Extremes and related properties of random sequences and processes
- Prophet-type inequalities for multi-choice optimal stopping
- Who solved the secretary problem? With comments and a rejoinder by the author
- A new secretary problem with rank-based selection and cardinal payoffs
- Sur la distribution limite du terme maximum d'une série aléatoire
- Multi-parameter mechanism design and sequential posted pricing
- Plausible and Genuine Extensions of L’Hospital's Rule
- On a Problem of L. Moser
- Polymatroid Prophet Inequalities
- Prophet Secretary
- The Temp Secretary Problem
- Optimal Auction Design
- Semiamarts and finite values
- Combinatorial Prophet Inequalities
- Online Independent Set Beyond the Worst-Case: Secretaries, Prophets, and Periods
- Beyond matroids: secretary problem and prophet inequality with general constraints
- Matroid prophet inequalities
- Bayesian Combinatorial Auctions: Expanding Single Buyer Mechanisms to Many Buyers
- The theory of dynamic programming
This page was built for publication: Hiring Secretaries over Time: The Benefit of Concurrent Employment