Exact results for a secretary problem

DOI10.2307/3215345zbMath0871.60037OpenAlexW2036617490MaRDI QIDQ4716089

J. S. Law, Malcolm Quine

Publication date: 19 November 1996

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/3215345

zbMATH Keywords

optimal stoppingMarkov chainbackwards induction

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (9)

Expected duration of the no-information minimum rank problem ⋮ Optimal Stopping of a Random Sequence with Unknown Distribution ⋮ A unified approach for solving sequential selection problems ⋮ Sequential selections with minimization of failure ⋮ Shelf life of candidates in the generalized secretary problem ⋮ Analysis of heuristic solutions to the best choice problem. ⋮ APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM ⋮ The solution of a generalized secretary problem via analytic expressions ⋮ A generalized secretary problem

This page was built for publication: Exact results for a secretary problem