An improvement on paulson s sequential ranking procedure
From MaRDI portal
Publication:4730634
DOI10.1080/07474948808836163zbMath0681.62063OpenAlexW1989119192MaRDI QIDQ4730634
Publication date: 1988
Published in: Sequential Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/07474948808836163
Jensen's inequalitygeometric inequalitybinomial populationselection proceduresnormal populationplay the winnerlargest population meanelimination proceduresPaulson's procedurebound on probability of correct selectionKoopman- Darmois family
Related Items (8)
A Fully Sequential Elimination Procedure for Indifference-Zone Ranking and Selection with Tight Bounds on Probability of Correct Selection ⋮ A comparison of the performances of procedures for selecting the normal population having the largest mean when the populations have a common unknown variance ⋮ Considering sample means in Rinott's procedure with a Bayesian approach ⋮ Fully sequential procedures for comparing constrained systems via simulation ⋮ A sequential procedure for neighborhood selection-of-the-best in optimization via simulation ⋮ An improvement on paulson's procedure for selecting the poprlation with the largest mean from k normal populations with a common unknown variance ⋮ Sequential Generalized Likelihood Ratios and Adaptive Treatment Allocation for Optimal Sequential Selection ⋮ Choosing the best arm with guaranteed confidence
Cites Work
- Note on Anderson's sequential procedures with triangular boundary
- A Sequential Procedure for Selecting the Population with the Largest Mean from $k$ Normal Populations
- An Extension of Paulson's Selection Procedure
- Play-the-winner sampling for selecting the better of two binomial populations
- A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
This page was built for publication: An improvement on paulson s sequential ranking procedure