Marginal improvement procedures for top-\(m\) selection
DOI10.1016/j.automatica.2024.111875MaRDI QIDQ6632511
Hui Xiao, Hai-Tao Liu, Unnamed Author, Ek Peng Chew
Publication date: 4 November 2024
Published in: Automatica (Search for Journal in Brave)
sequential samplingranking and selectionsimulation of dynamic systemsOCBAmodeling and control of discrete event and hybrid systems
Epidemiology (92D30) Discrete event control/observation systems (93C65) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30) Mathematical modeling or simulation for problems pertaining to systems and control theory (93-10)
Cites Work
- Efficient subset selection for the expected opportunity cost
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Simulation budget allocation for simultaneously selecting the best and worst subsets
- Robust ranking and selection with optimal computing budget allocation
- Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
- Simulation Allocation for Determining the Best Design in the Presence of Correlated Sampling
- Sequential Sampling to Myopically Maximize the Expected Value of Information
- Indifference-Zone-Free Selection of the Best
- A Simulation Budget Allocation Procedure for Enhancing the Efficiency of Optimal Subset Selection
- Dynamic Sampling Allocation and Design Selection
- MO2TOS: Multi-Fidelity Optimization with Ordinal Transformation and Optimal Sampling
- A Knowledge-Gradient Policy for Sequential Information Collection
- Compartmental Models in Epidemiology
- A procedure for selecting a subset of size m containing the l best of k independent normal populations, with applications to simulation
- Computing efforts allocation for ordinal optimization and discrete event simulation
- A New Budget Allocation Framework for the Expected Opportunity Cost
- Ranking and Selection as Stochastic Control
- Gradient-Based Myopic Allocation Policy: An Efficient Sampling Procedure in a Low-Confidence Scenario
- Simulation Budget Allocation for Selecting the Top-m Designs With Input Uncertainty
- Gaussian Markov Random Fields for Discrete Optimization via Simulation: Framework and Algorithms
- Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments
- Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures
- Simulation Optimization: A Review and Exploration in the New Era of Cloud Computing and Big Data
- Myopic Allocation Policy With Asymptotically Optimal Sampling Rate
- Efficient Dynamic Simulation Allocation in Ordinal Optimization
- Stay Home or Not? Modeling Individuals’ Decisions During the COVID-19 Pandemic
- Asymptotically Optimal Sampling Policy for Selecting Top-m Alternatives
- Forecasting COVID-19 and Analyzing the Effect of Government Interventions
This page was built for publication: Marginal improvement procedures for top-\(m\) selection