The Best-or-Worst and the Postdoc problems with random number of candidates
- 1 December 2018
- journal article
- research article
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 38 (1) , 86-110
Abstract
No abstract availableKeywords
All Related Versions
This publication has 15 references indexed in Scilit:
- The Best-or-Worst and the Postdoc problemsJournal of Combinatorial Optimization, 2017
- Weber’s optimal stopping problem and generalizationsStatistics & Probability Letters, 2015
- On Variants of the Matroid Secretary ProblemAlgorithmica, 2013
- The secretary problem on an unknown posetRandom Structures & Algorithms, 2012
- Partially ordered secretariesElectronic Communications in Probability, 2010
- On a universal best choice algorithm for partially ordered setsRandom Structures & Algorithms, 2007
- A note on bounds for the odds theorem of optimal stoppingThe Annals of Probability, 2003
- Sum the odds to one and stopThe Annals of Probability, 2000
- Who Solved the Secretary Problem?Statistical Science, 1989
- On an optimal selection problem of Cowan and ZabczykJournal of Applied Probability, 1987