Select sets: rank and file

DOI10.1214/105051606000000691zbMATH Open1128.62024arXivmath/0703032OpenAlexW2048252083MaRDI QIDQ2467122FDOQ2467122

Abba M. Krieger, Ester Samuel-Cahn, Moshe Pollak

Publication date: 18 January 2008

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Abstract: In many situations, the decision maker observes items in sequence and needs to determine whether or not to retain a particular item immediately after it is observed. Any decision rule creates a set of items that are selected. We consider situations where the available information is the rank of a present observation relative to its predecessors. Certain ``natural selection rules are investigated. Theoretical results are presented pertaining to the evolution of the number of items selected, measures of their quality and the time it would take to amass a group of a given size.

Full work available at URL: https://arxiv.org/abs/math/0703032

Recommendations

• The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations
• A rank-based selection with cardinal payoffs and a cost of choice
• scientific article; zbMATH DE number 5823899
• On-line selection of an acceptable pair
• scientific article

zbMATH Keywords

asymptoticsnonparametricssequential observations

Mathematics Subject Classification ID

Asymptotic properties of nonparametric inference (62G20) Statistical ranking and selection procedures (62F07) Nonparametric inference (62G99) Strong limit theorems (60F15) Sequential statistical methods (62L99)

Cites Work

• Extremes and related properties of random sequences and processes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Multiple Choice Secretary Problems
• Sequential selection with a better-than-average rule

Cited In (9)

• A nonparametric predictive approach to sequential acceptance problems
• The hiring problem with rank-based strategies
• A unified approach for solving sequential selection problems
• The secretary problem of minimizing the expected rank: a simple suboptimal approach with generalizations
• Analysis of the strategy ``hiring above the \(m\)-th best candidate
• ANALYTIC METHODS FOR SELECT SETS
• Analysis of the ``hiring above the median selection strategy for the hiring problem
• Beat the Mean: Sequential Selection by Better Than Average Rules
• Extreme(ly) mean(ingful): sequential formation of a quality group

This page was built for publication: Select sets: rank and file

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