An additive allocation procedure for distributionally robust ranking and selection is proven consistent, with only k+m-1 scenarios sampled infinitely often as the budget grows.
Discrete Event Dynamic Systems 10:251--270
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2025 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Additive Distributionally Robust Ranking and Selection
An additive allocation procedure for distributionally robust ranking and selection is proven consistent, with only k+m-1 scenarios sampled infinitely often as the budget grows.