2017
DOI: 10.1016/j.automatica.2017.03.019
|View full text |Cite
|
Sign up to set email alerts
|

Robust ranking and selection with optimal computing budget allocation

Abstract: a b s t r a c tIn this paper, we consider the ranking and selection (R&S) problem with input uncertainty. It seeks to maximize the probability of correct selection (PCS) for the best design under a fixed simulation budget, where each design is measured by their worst-case performance. To simplify the complexity of PCS, we develop an approximated probability measure and derive an asymptotically optimal solution of the resulting problem. An efficient selection procedure is then designed within the optimal comput… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
15
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2

Relationship

3
5

Authors

Journals

citations
Cited by 51 publications
(17 citation statements)
references
References 18 publications
1
15
0
Order By: Relevance
“…In this research, the robust ranking technique, employed in many papers [14][15][16][17] for easier and faster ordering of results, is used to rank the information obtained from experts.…”
Section: Introductionmentioning
confidence: 99%
“…In this research, the robust ranking technique, employed in many papers [14][15][16][17] for easier and faster ordering of results, is used to rank the information obtained from experts.…”
Section: Introductionmentioning
confidence: 99%
“…By doing so, the problem scale is reduced from km to k + m − 1, and thus the computing efficiency has the potential to be substantially improved. This observation is consistent with the selection rules for unconstrained robust R&S (Fan et al, in press;Gao, Xiao, et al, 2017).…”
Section: Asymptotic Optimality Conditionsupporting
confidence: 89%
“…Following this direction, Corlu and Biller () developed a robust R&S procedure for subset selection. Fan, Hong, and Zhang (in press) and Gao, Xiao, Zhou, and Chen () selected the best design with respect to the worst‐case choices among a finite collection of possible input models using the IZ and OCBA approaches respectively. However, none of these developments address the input uncertainty for R&S under stochastic constraints.…”
Section: Introductionmentioning
confidence: 99%
“…Although these studies are also based on partitioning or metamodeling, they do not aim to select the top m designs, and are therefore different in objectives from this research. Other variants of OCBA include selecting the best design considering resource sharing and allocation (Peng et al, 2013) and input uncertainty (Gao et al, 2017b).…”
Section: Introductionmentioning
confidence: 99%