Dynamic sampling allocation and design selection
From MaRDI portal
Recommendations
Cites work
- A Bayesian Approach to Ranking and Selection of Related Means With Alternatives to Analysis-of-Variance Methodology
- A Knowledge-Gradient Policy for Sequential Information Collection
- An empirical evaluation of several methods to select the best system
- Bayesian look ahead one-stage sampling allocations for selection of the best population
- Efficient Dynamic Simulation Allocation in Ordinal Optimization
- Efficient Simulation Resource Sharing and Allocation for Selecting the Best
- On the Markov chain central limit theorem
- Selecting a selection procedure
- Sequential sampling to myopically maximize the expected value of information
- Simulation allocation for determining the best design in the presence of correlated sampling
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Stochastically Constrained Ranking and Selection via SCORE
Cited in
(22)- On the probability of correct selection in ordinal comparison over dynamic networks
- Efficient estimation of a risk measure requiring two-stage simulation optimization
- Simulation allocation for determining the best design in the presence of correlated sampling
- scientific article; zbMATH DE number 5974807 (Why is no real title available?)
- Dynamic Allocation in Survey Sampling
- Optimal learning for nonlinear parametric belief models over multidimensional continuous spaces
- Adaptive simulation selection for the discovery of the ground state line of binary alloys with a limited computational budget
- More data or better data? A statistical decision problem
- The local time method for targeting and selection
- Efficient Sampling Allocation Procedures for Optimal Quantile Selection
- Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination
- Practical Nonparametric Sampling Strategies for Quantile-Based Ordinal Optimization
- Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures
- Computational efficiency in multivariate adversarial risk analysis models
- Tractable sampling strategies for ordinal optimization
- Simple Bayesian algorithms for best-arm identification
- Sequential Bayes-optimal policies for multiple comparisons with a known standard
- Complete expected improvement converges to an optimal budget allocation
- Information theory for ranking and selection
- Efficient learning for clustering and optimizing context-dependent designs
- Marginal improvement procedures for top-\(m\) selection
- A budget-adaptive allocation rule for optimal computing budget allocation
This page was built for publication: Dynamic sampling allocation and design selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186646)
