A Secretary Problem with Many Lives

DOI10.1080/03610926.2011.654040MaRDI QIDQ2815355zbMATH OpenOpenAlexFDO

Authors Małgorzata Kuchta, Michał Morayne

Publication date 28 June 2016

Published in Communications in Statistics. Theory and Methods (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610926.2011.654040

zbMATH Keywords

best choiceoptimal stopping timesecretary problem

Mathematics Subject Classification ID

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

Cites work

• A secretary problem with uncertain employment
• Dynamic Programming and Decision Theory
• scientific article; zbMATH DE number 3734865 (Why is no real title available?)
• scientific article; zbMATH DE number 3369559 (Why is no real title available?)
• Partial-order analogue of the secretary problem: The binary tree case
• Partially ordered secretaries
• Recognizing the maximum of a random sequence based on relative rank with backward solicitation

Cited in

(4)

• Iterated full information secretary problem
• The best choice problem for a union of two linear orders with common maximum
• Monotone Case for an Extended Process
• Maximizing survival time in a random walk on an interval

This page was built for publication: A Secretary Problem with Many Lives

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