A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation

DOI10.1080/03610918508812467zbMATH Open0576.62036OpenAlexW2029530218MaRDI QIDQ3696306FDOQ3696306

Authors: Lloyd W. Koenig, Averill M. Law 

Publication date: 1985

Published in: Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03610918508812467

Recommendations

• Restricted Subset Selection Procedures for Simulation
• Subset selection of the t best populations
• Simultaneous Selection of Extreme Populations: A Subset Selection Approach
• Single-stage sampling procedure of the \(t\) best populations under heteroscedasticity
• An optimal two-stage procedure to select the best out of a normal population

zbMATH Keywords

Discrete event simulationprobability of correct selectionindifference zone approachindependent normal populationstwo-stage sampling procedure

Mathematics Subject Classification ID

Statistical ranking and selection procedures (62F07)

Cites Work

• A Two-Sample Test for a Linear Hypothesis Whose Power is Independent of the Variance
• A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
• Title not available (Why is that?)
• Some Fixed-Sample Ranking and Selection Problems

Cited In (21)

• A new budget allocation framework for the expected opportunity cost
• Optimal budget allocation policy for tabu search in stochastic simulation optimization
• A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
• Pruning inferior systems using subjective constraints with sequentially added thresholds
• An efficient simulation procedure for the expected opportunity cost using metamodels
• Selection of the best in the presence of subjective stochastic constraints
• On selecting a process with the smallest number of unfortunate events
• Selecting the best simulated system with weighted control-variate estimators
• Gaussian Markov random fields for discrete optimization via simulation: framework and algorithms
• A multi-objective selection procedure of determining a Pareto set
• Input-output uncertainty comparisons for discrete optimization via simulation
• Efficient subset selection for the expected opportunity cost
• Marginal improvement procedures for top-\(m\) selection
• Penalty function with memory for discrete optimization via simulation with stochastic constraints
• Good arm identification via bandit feedback
• Finding Feasible Systems for Subjective Constraints Using Recycled Observations
• An Integrated Formulation For Selecting The t Best Of k Normal Populations
• Rapid Discrete Optimization via Simulation with Gaussian Markov Random Fields
• Designing selection experiments with bernoulli populations
• Efficient simulation budget allocation for ranking the top \(m\) designs
• A new approach to estimate the critical constant of selection procedures

This page was built for publication: A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation

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