The multi-returning secretary problem
From MaRDI portal
Publication:2166212
DOI10.1016/j.dam.2022.05.020zbMath1505.91120arXiv2009.07911MaRDI QIDQ2166212
M. M. Ruiz, L. Bayón, José María Grau, Pedro Fortuny Ayuso, Antonio M. Oller-Marcén
Publication date: 24 August 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.07911
dynamic programming; combinatorial optimization; secretary problem; multi-returning secretary problem
90C27: Combinatorial optimization
90C39: Dynamic programming
60G40: Stopping times; optimal stopping problems; gambling theory
91A55: Games of timing
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Who solved the secretary problem
- The best-or-worst and the postdoc problems
- Sum the odds to one and stop
- A new look at the returning secretary problem
- The best-or-worst and the postdoc problems with random number of candidates
- How to Choose the Best Twins
- The Returning Secretary
- A rank-based selection with cardinal payoffs and a cost of choice
- A secretary problem with uncertain employment
- Dynamic Programming and Decision Theory