A new approach to estimate the critical constant of selection procedures (Q965881): Difference between revisions

Summary: A solution to the ranking and selection problem of determining a subset of size \(m\) containing at least \(c\) of the \(v\) best from \(k\) normal distributions has been developed. The best distributions are those having, for example, (i) the smallest means, or (ii) the smallest variances. This paper reviews various applicable algorithms and supplies the operating constants needed to apply these solutions. The constants are computed using a histogram approximation algorithm and Monte Carlo integration.