Dynamic programming and the secretary problem

DOI10.1016/0898-1221(90)90145-AMaRDI QIDQ918875zbMATH OpenFDO

Authors Martin J. Beckmann

Publication date 1990

Published in Computers & Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

secretary problem

Mathematics Subject Classification ID

Dynamic programming (90C39) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)

Recommendations

• The Secretary Problem with Optimal Assignment
• The Secretary Problem and Its Extensions: A Review
• Secretary Problems via Linear Programming
• Secretary Problems via Linear Programming
• A generalized secretary problem
• On a problem of the theory of dynamic programming
• APPROXIMATE RESULTS FOR A GENERALIZED SECRETARY PROBLEM
• scientific article; zbMATH DE number 1260458
• scientific article; zbMATH DE number 1431652

Cites work

• scientific article; zbMATH DE number 2177809 (Why is no real title available?)
• scientific article; zbMATH DE number 3383344 (Why is no real title available?)
• Dynamic Programming and Decision Theory
• Finite state Markovian decision processes

Cited in

(4)

• Robust Algorithms for the Secretary Problem
• The secretary recommendation problem
• A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates
• Generative models in the problem of evaluating the efficiency of computer algorithms

This page was built for publication: Dynamic programming and the secretary problem

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