A budget-adaptive allocation rule for optimal computing budget allocation

DOI10.1016/J.EJOR.2025.04.015MaRDI QIDQ6981353zbMATH OpenFDO

Authors Zirui Cao, Haowei Wang, Ek Peng Chew, Haobin Li, Kok Choon Tan

Publication date 20 May 2025

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.EJOR.2025.04.015

zbMATH Keywords

budget-adaptive allocation ruleoptimal computing budget allocationranking and selectionsimulation

Mathematics Subject Classification ID

Convex programming (90C25) Applications of mathematical programming (90C90) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• A fully sequential procedure for indifference-zone selection in simulation
• A Knowledge-Gradient Policy for Sequential Information Collection
• A lower bound for the correct subset-selection probability and its application to discrete-event system simulations
• A new budget allocation framework for the expected opportunity cost
• A Simulation Budget Allocation Procedure for Enhancing the Efficiency of Optimal Subset Selection
• Bonferroni inequalities
• Convergence rate analysis for optimal computing budget allocation algorithms
• Dynamic sampling allocation and design selection
• Efficient estimation of a risk measure requiring two-stage simulation optimization
• Efficient learning for clustering and optimizing context-dependent designs
• Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
• Gradient-Based Myopic Allocation Policy: An Efficient Sampling Procedure in a Low-Confidence Scenario
• Handbook of simulation optimization
• Handbooks in operations research and management science: Simulation
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• Indifference-Zone-Free Selection of the Best
• Joint optimization of budget allocation and maintenance planning of multi-facility transportation infrastructure systems
• Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
• Myopic Allocation Policy With Asymptotically Optimal Sampling Rate
• On the convergence rates of expected improvement methods
• On the finite-sample statistical validity of adaptive fully sequential procedures
• Ordinal optimization of DEDS
• Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures
• Ranking and Selection as Stochastic Control
• Robust ranking and selection with optimal computing budget allocation
• Sequential sampling to myopically maximize the expected value of information
• Simulation budget allocation for further enhancing the efficiency of ordinal optimization
• Simulation Budget Allocation for Selecting the Top-m Designs With Input Uncertainty
• Solving Large-Scale Fixed-Budget Ranking and Selection Problems
• Stochastically Constrained Ranking and Selection via SCORE
• The knowledge gradient algorithm for a general class of online learning problems

This page was built for publication: A budget-adaptive allocation rule for optimal computing budget allocation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981353)