2008
DOI: 10.1287/ijoc.1080.0268
|View full text |Cite
|
Sign up to set email alerts
|

Efficient Simulation Budget Allocation for Selecting an Optimal Subset

Abstract: W e consider a class of the subset selection problem in ranking and selection. The objective is to identify the top m out of k designs based on simulated output. Traditional procedures are conservative and inefficient. Using the optimal computing budget allocation framework, we formulate the problem as that of maximizing the probability of correctly selecting all of the top-m designs subject to a constraint on the total number of samples available. For an approximation of this correct selection probability, we… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
111
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 204 publications
(111 citation statements)
references
References 25 publications
0
111
0
Order By: Relevance
“…The allocation may be between exploration of different designs and estimation of objective function values at specific designs as in global optimization [10,14], between estimation of different random variables nested by conditioning [21], or between estimation of different expected system performances in ranking and selection [9]. These studies typically define an optimal allocation as one that makes the estimator mean-squared error vanish at the fastest possible rate as the computing budget tends to infinity.…”
Section: Introductionmentioning
confidence: 99%
“…The allocation may be between exploration of different designs and estimation of objective function values at specific designs as in global optimization [10,14], between estimation of different random variables nested by conditioning [21], or between estimation of different expected system performances in ranking and selection [9]. These studies typically define an optimal allocation as one that makes the estimator mean-squared error vanish at the fastest possible rate as the computing budget tends to infinity.…”
Section: Introductionmentioning
confidence: 99%
“…There are many variants of OCBA that consider correlated sampling [16]; non-normal distributions [17]; different objective functions [18]; subset selection [19]; complete ranking [20]; and constraints [21]. Lee et al [22] provided a comprehensive review of these OCBA procedures.…”
Section: 2mentioning
confidence: 99%
“…One is to maximize the probability of choosing the top m systems (Chen, He, Fu, and Lee 2008), while others wish to choose a subset of size m that contains some number of the best systems (Koenig and Law 1985). In Ryzhov and Powell (2009), possible subsets are treated as individual alternatives and sampling rules applied to choose the best subset.…”
Section: Literature Reviewmentioning
confidence: 99%