Single Threshold Selection Strategy In The Group Interview Problem

DOI10.1080/03155986.1997.11732326MaRDI QIDQ4372887zbMATH OpenOpenAlexFDO

Authors Herbert Moskowitz, Young H. Chun, Robert D. Plante

Publication date 17 December 1997

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

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

zbMATH Keywords

sequential decision makingsecretary problemoptimal stopping rulediscrete searchaspiration-levelrandom sequence of offers

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Decision theory (91B06) Stopping times; optimal stopping problems; gambling theory (60G40) Markov and semi-Markov decision processes (90C40)

Recommendations

• Selecting the best choice in the full information group interview problem
• Dynamic programming formulation of the group interview problem with a general utility function
• Optimal partitioning of groups in selecting the best choice
• scientific article; zbMATH DE number 5823899
• Sequential selections with minimization of failure

Cited in

(3)

• Optimal partitioning of groups in selecting the best choice
• Selecting the best choice in the full information group interview problem
• Dynamic programming formulation of the group interview problem with a general utility function

This page was built for publication: Single Threshold Selection Strategy In The Group Interview Problem

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