Shelf life of candidates in the generalized secretary problem
DOI10.1016/j.orl.2016.05.002zbMath1380.91105arXiv0902.0232OpenAlexW2951092654MaRDI QIDQ1694784
Krzysztof J. Szajowski, Mitsushi Tamaki
Publication date: 6 February 2018
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0902.0232
secretary problembest-choice duration modelno-information caserecalls of preceding observationsrelative best rank
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Optimal stopping in statistics (62L15) Matching models (91B68)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Duration problem with multiple exchanges
- Choosing either the best or the second best when the number of applicants is random
- The full-information best choice problem with a random number of observations
- On a best choice problem with partial information
- Who solved the secretary problem
- On best choice problems having similar solutions
- Best choice from the planar Poisson process
- Recognizing both the maximum and the second maximum of a sequence
- The Best Choice Problem for a Random Number of Objects
- Duration of a secretary problem
- Optimal and asymptotically optimal decision rules for sequential screening and resource allocation
- Objectives in the Best-Choice Problems
- Exact results for a secretary problem
- Why do these quite different best-choice problems have the same solutions?
- SELECTING SATISFACTORY SECRETARIES
- Optimal Stopping with Rank-Dependent Loss
- An Explicit Formula for the Optimal Gain in the Full-Information Problem of Owning a Relatively Best Object
This page was built for publication: Shelf life of candidates in the generalized secretary problem
