Optimizing a single uncertain selection by recall of observations

DOI10.2307/3215146MaRDI QIDQ4322020zbMATH OpenOpenAlexFDO

Authors Ted D. Sweet

Publication date 6 April 1995

Published in Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/3215146

zbMATH Keywords

marriage problemoptimal strategiesrelative rankssecretary problem

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1766760
• SELECTING SATISFACTORY SECRETARIES
• scientific article; zbMATH DE number 4137111
• Best-choice problems involving recall and uncertainty of selection when the number of observations is random
• Optimal selection with randomly fading memory

Cited in

(9)

• An optimal choice problem for uniform random variables seen simultaneously or sequentially with availability depending on the observation.
• Bayesian solutions to graduate admissions and related selection problems
• Optimal Sequential Selection Based on Relative Ranks with Renewable Call Options
• scientific article; zbMATH DE number 4137111 (Why is no real title available?)
• A Secretary Problem with Uncertain Employment and Best Choice of Available Candidates
• Average number of candidates surveyed by the headhunter in the recruitment
• Optimal selection with randomly fading memory
• Competition and recall in selection problems
• Optimal stopping problems by two or more decision makers: a survey

Describes a project that uses

Uses Software

• InterViewer

This page was built for publication: Optimizing a single uncertain selection by recall of observations

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