Algorithm for Calculating the Initial Sample Size in a Fully Sequential Ranking and Selection Procedure
From MaRDI portal
Publication:5149555
Recommendations
- scientific article; zbMATH DE number 1881949
- Ranked Set Sampling with Size-Biased Probability of Selection
- An algorithm with applications in ranked-set sampling
- Lower Bound for the Average Sample Size and the Efficiency of Ranking Sequential Procedures
- Lower bounds for the expected sample size of sequential procedures for selecting and ranking of binomial and Poisson populations
- Ranked Set Sampling: Cost and Optimal Set Size
Cites work
- A Comparison of the Asymptotic Expected Sample Sizes of Two Sequential Procedures for Ranking Problem
- A comparison of the performances of procedures for selecting the normal population having the largest mean when the populations have a common unknown variance
- A fully sequential procedure for indifference-zone selection in simulation
- A Sequential Procedure for Selecting the Population with the Largest Mean from k Normal Populations
- A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
- An efficient simulation procedure for ranking the top simulated designs in the presence of stochastic constraints
- An improvement on paulson's procedure for selecting the poprlation with the largest mean from k normal populations with a common unknown variance
- Combined variance reduction techniques in fully sequential selection procedures
- Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
- Fully sequential procedures for comparing constrained systems via simulation
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Gradient-Based Myopic Allocation Policy: An Efficient Sampling Procedure in a Low-Confidence Scenario
- Handbooks in operations research and management science: Simulation
- scientific article; zbMATH DE number 3915462 (Why is no real title available?)
- Indifference-Zone-Free Selection of the Best
- Myopic Allocation Policy With Asymptotically Optimal Sampling Rate
- Note on Anderson's sequential procedures with triangular boundary
- Ranking and Selection as Stochastic Control
- Reducing the Conservativeness of Fully Sequential Indifference-Zone Procedures
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- The first-passage density of a continuous gaussian process to a general boundary
Cited in
(2)
This page was built for publication: Algorithm for Calculating the Initial Sample Size in a Fully Sequential Ranking and Selection Procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5149555)
