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

DOI10.1016/J.AAM.2022.102468OpenAlexW4311091588MaRDI QIDQ2111202FDOQ2111202

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

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

Recommendations

• A generalization of the classical secretary problem: dependent arrival sequences
• OPTIMAL SELECTION OF THE k-TH BEST CANDIDATE
• Optimal Stopping for I.I.D. Random Variables Based on the Sequential Information of the Location of Relative Records Only
• scientific article; zbMATH DE number 3928135
• Optimal selection problems based on exchangeable trials
• scientific article; zbMATH DE number 1775155
• scientific article; zbMATH DE number 1894648
• Best-choice problems involving recall and uncertainty of selection when the number of observations is random
• The best choice problem for a union of two linear orders with common maximum

zbMATH Keywords

combinatorial optimizationoptimal stoppingsecretary problem

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Secretary problem with hidden information; searching for a high merit candidate

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