Secretary problem with hidden information; searching for a high merit candidate

DOI10.1016/j.aam.2022.102468OpenAlexW4311091588MaRDI QIDQ2111202

Michał Morayne, Małgorzata Kuchta, Grzegorz M. Kubicki, Ewa M. Kubicka

Publication date: 28 December 2022

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2022.102468

zbMATH Keywords

optimal stoppingcombinatorial optimizationsecretary problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stopping times; optimal stopping problems; gambling theory (60G40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Partially ordered secretaries
• Optimal stopping in a search for a vertex with full degree in a random graph
• Comparison of threshold stop rules and maximum for independent nonnegative random variables
• Who solved the secretary problem
• Partial-order analogue of the secretary problem: The binary tree case
• Iterated full information secretary problem
• The best-choice problem for partially ordered objects.
• Optimal selection based on relative rank (the 'Secretary Problem')
• An optimal algorithm for stopping on the element closest to the center of an interval
• The Secretary Problem and Its Extensions: A Review
• Probabilities of choosing applicants of arbitrary rank in the secretary problem
• Percolation and best-choice problem for powers of paths
• Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
• Dynamic Programming and Decision Theory