EconPapers    
Economics at your fingertips  
 

The Best-or-Worst and the Postdoc problems with random number of candidates

L. Bayón (), P. Fortuny (), J. Grau (), A. M. Oller-Marcén () and M. M. Ruiz ()
Additional contact information
L. Bayón: Universidad de Oviedo
P. Fortuny: Universidad de Oviedo
J. Grau: Universidad de Oviedo
A. M. Oller-Marcén: Centro Universitario de la Defensa de Zaragoza - IUMA
M. M. Ruiz: Universidad de Oviedo

Journal of Combinatorial Optimization, 2019, vol. 38, issue 1, No 5, 86-110

Abstract: Abstract In this paper we consider two variants of the Secretary problem: The Best-or-Worst and the Postdoc problems. We extend previous work by considering that the number of objects is not known and follows either a discrete Uniform distribution $${\mathcal {U}}[1,n]$$ U [ 1 , n ] or a Poisson distribution $${\mathcal {P}} (\lambda )$$ P ( λ ) . We show that in any case the optimal strategy is a threshold strategy, we provide the optimal cutoff values and the asymptotic probabilities of success. We also put our results in relation with closely related work.

Keywords: Secretary problem; Best-or-Worst problem; Postdoc problem; Combinatorial optimization; 60G40; 62L15 (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0367-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-018-0367-6

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0367-6

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-018-0367-6