The best-or-worst and the postdoc problems with random number of candidates
From MaRDI portal
Publication:2424796
DOI10.1007/s10878-018-0367-6zbMath1461.90115arXiv1809.06390OpenAlexW2890458832MaRDI QIDQ2424796
L. Bayón, M. M. Ruiz, José María Grau, Antonio M. Oller-Marcén, Pedro Fortuny Ayuso
Publication date: 25 June 2019
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.06390
Combinatorial optimization (90C27) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)
Related Items (3)
The multi-returning secretary problem ⋮ Finding the second-best candidate under the Mallows model ⋮ A new method for computing asymptotic results in optimal stopping problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partially ordered secretaries
- Who solved the secretary problem
- A note on bounds for the odds theorem of optimal stopping.
- The best-or-worst and the postdoc problems
- Sum the odds to one and stop
- On variants of the matroid secretary problem
- Weber's optimal stopping problem and generalizations
- A game version of the Cowan-Zabczyk-Bruss' problem
- Matroid Secretary Problem in the Random-Assignment Model
- The secretary problem on an unknown poset
- On a universal best choice algorithm for partially ordered sets
- A rank-based selection with cardinal payoffs and a cost of choice
- On an optimal selection problem of Cowan and Zabczyk
- A Problem of Optimal Choice and Assignment
- The Best Choice Problem for a Random Number of Objects
- The postdoc variant of the secretary problem
- Dokładna i asymptotyczna analiza rozwiązań optymalnych problemów zatrzymania Brussa i Webera
- New developments of the odds theorem
- Dynamic Programming and Decision Theory
This page was built for publication: The best-or-worst and the postdoc problems with random number of candidates
