Optimal selection based on relative ranks of a sequence by ties

DOI10.2307/1427228MaRDI QIDQ3317831zbMATH OpenOpenAlexFDO

Authors Gregory Campbell

Publication date 1984

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

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

zbMATH Keywords

best choice problemDirichlet processoptimal stopping problemrelative rankssecretary problem

Mathematics Subject Classification ID

Stopping times; optimal stopping problems; gambling theory (60G40)

Recommendations

• scientific article; zbMATH DE number 6691960
• An optimal sequential selection procedure
• A rank-based approach to the sequential selection and assignment problem
• A fully sequential elimination procedure for indifference-zone ranking and selection with tight bounds on probability of correct selection
• Rank and select revisited and extended
• Optimal Sequential selection of n random variables under a constraint
• Optimal selection of the \(k\) best of a sequence with \(k\) stops
• scientific article; zbMATH DE number 1304767

Cited in

(9)

• On the game of googol
• Optimal selection of the \(k\) best of a sequence with \(k\) stops
• Sequential selection with a better-than-average rule
• A rank-based approach to the sequential selection and assignment problem
• Optimal selection problems based on exchangeable trials
• scientific article; zbMATH DE number 6691960 (Why is no real title available?)
• scientific article; zbMATH DE number 5823899 (Why is no real title available?)
• scientific article; zbMATH DE number 3901857 (Why is no real title available?)
• Optimal rules for the sequential selection of uniform spacings

This page was built for publication: Optimal selection based on relative ranks of a sequence by ties

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