A new look at the returning secretary problem

DOI10.1007/s10878-018-0349-8zbMath1435.90121OpenAlexW2889721448WikidataQ129249659 ScholiaQ129249659MaRDI QIDQ2424722

José María Grau

Publication date: 25 June 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-018-0349-8

zbMATH Keywords

combinatorial optimizationsecretary problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stopping times; optimal stopping problems; gambling theory (60G40) Optimal stopping in statistics (62L15)

Related Items (5)

Average number of candidates surveyed by the headhunter in the recruitment ⋮ The multi-returning secretary problem ⋮ Sequential selections with minimization of failure ⋮ Unnamed Item ⋮ A new method for computing asymptotic results in optimal stopping problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partially ordered secretaries
• Who solved the secretary problem
• The best-or-worst and the postdoc problems
• A new secretary problem with rank-based selection and cardinal payoffs
• The secretary problem on an unknown poset
• How to Choose the Best Twins
• The Returning Secretary
• On a universal best choice algorithm for partially ordered sets
• A rank-based selection with cardinal payoffs and a cost of choice
• Dynamic Programming and Decision Theory

This page was built for publication: A new look at the returning secretary problem