Expected duration of the no-information minimum rank problem

DOI10.1016/J.SPL.2020.108950zbMATH Open1455.60065OpenAlexW3088856402MaRDI QIDQ826693FDOQ826693

Authors: Simon Demers 

Publication date: 6 January 2021

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2020.108950

Recommendations

• Minimizing the expected rank with full information
• Remarks on the Secretary Problem
• Minimal expected ranks for the secretary problems with uncertain selection
• The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations
• Probabilities of choosing applicants of arbitrary rank in the secretary problem

zbMATH Keywords

optimal stoppingsequential decisionsearch time

Mathematics Subject Classification ID

Extreme value theory; extremal stochastic processes (60G70) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Cites Work

• Who solved the secretary problem
• Analysis of heuristic solutions to the best choice problem.
• Dynamic Programming and Decision Theory
• Optimal selection based on relative rank (the 'Secretary Problem')
• On an optimal stopping problem of Gusein-Zade
• A unified approach for solving sequential selection problems
• Duration of a secretary problem
• Exact results for a secretary problem
• On Asymptotic Properties of Optimal Stopping Time
• Title not available (Why is that?)

Cited In (3)

• Average number of candidates surveyed by the headhunter in the recruitment
• Sequential selections with minimization of failure
• A Continuous-Time Approach to Robbins' Problem of Minimizing the Expected Rank

This page was built for publication: Expected duration of the no-information minimum rank problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q826693)