Iterated full information secretary problem

DOI10.1007/S00186-017-0594-0zbMath1386.60154OpenAlexW2622750591WikidataQ59610783 ScholiaQ59610783MaRDI QIDQ1683938

Małgorzata Kuchta

Publication date: 1 December 2017

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-017-0594-0

zbMATH Keywords

optimal stopping timebest choicesecretary problemmonotone casefull information

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (7)

Monotone Case for an Extended Process ⋮ Running minimum in the best-choice problem ⋮ Unnamed Item ⋮ Robust best choice problem ⋮ Maximizing survival time in a random walk on an interval ⋮ Full-information best choice game with hint ⋮ Secretary problem with hidden information; searching for a high merit candidate

Cites Work

• Unnamed Item
• A Secretary Problem with Many Lives
• Monotone Case for an Extended Process
• On the full information best-choice problem

This page was built for publication: Iterated full information secretary problem