Open Access
2020 A unified approach for solving sequential selection problems
Alexander Goldenshluger, Yaakov Malinovsky, Assaf Zeevi
Probab. Surveys 17: 214-256 (2020). DOI: 10.1214/19-PS333


In this paper we develop a unified approach for solving a wide class of sequential selection problems. This class includes, but is not limited to, selection problems with no–information, rank–dependent rewards, and considers both fixed as well as random problem horizons. The proposed framework is based on a reduction of the original selection problem to one of optimal stopping for a sequence of judiciously constructed independent random variables. We demonstrate that our approach allows exact and efficient computation of optimal policies and various performance metrics thereof for a variety of sequential selection problems, several of which have not been solved to date.


Download Citation

Alexander Goldenshluger. Yaakov Malinovsky. Assaf Zeevi. "A unified approach for solving sequential selection problems." Probab. Surveys 17 214 - 256, 2020.


Received: 1 May 2019; Published: 2020
First available in Project Euclid: 27 April 2020

Digital Object Identifier: 10.1214/19-PS333

Primary: 60G40
Secondary: 62L15

Keywords: full information problems , no–information problems , Optimal stopping , relative ranks , secretary problems , sequential selection

Vol.17 • 2020
Back to Top