Efficient Ranking and Selection in Parallel Computing Environments
From MaRDI portal
Publication:4604911
DOI10.1287/opre.2016.1577zbMath1384.62060arXiv1506.04986OpenAlexW2963862167MaRDI QIDQ4604911
Eric Cao Ni, Dragos Florin Ciocan, Susan R. Hunter, Shane G. Henderson
Publication date: 6 March 2018
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.04986
Related Items (16)
On parallel policies for ranking and selection problems ⋮ Solving Large-Scale Fixed-Budget Ranking and Selection Problems ⋮ Ranking and Selection with Covariates for Personalized Decision Making ⋮ Dynamic Sampling Allocation Under Finite Simulation Budget for Feasibility Determination ⋮ Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing ⋮ Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee ⋮ Posterior-Based Stopping Rules for Bayesian Ranking-and-Selection Procedures ⋮ Information theory for ranking and selection ⋮ Improved feature selection with simulation optimization ⋮ Selecting the Best Simulated System: Thinking Differently About an Old Problem ⋮ A unified framework for stochastic optimization ⋮ Simple Bayesian Algorithms for Best-Arm Identification ⋮ Distributed simulation: state-of-the-art and potential for operational research ⋮ MapRedRnS ⋮ Optimal budget allocation policy for tabu search in stochastic simulation optimization ⋮ Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments
Uses Software
Cites Work
- Unnamed Item
- Handbook of simulation optimization
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Optimization via simulation: A review
- Using rngstreams for parallel random number generation in C++ and R
- A sequential procedure for neighborhood selection-of-the-best in optimization via simulation
- Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
- Feature Article: Optimization for simulation: Theory vs. Practice
- Selecting a Selection Procedure
- On the Asymptotic Validity of Fully Sequential Selection Procedures for Steady-State Simulation
- Using Ranking and Selection to “Clean Up” after Simulation Optimization
- Discrete Event Simulations and Parallel Processing: Statistical Properties
- Bias Properties of Budget Constrained Simulations
- The Asymptotic Efficiency of Simulation Estimators
- On two-stage selection procedures and related probability-inequalities
- A fully sequential procedure for indifference-zone selection in simulation
- Analysis of parallel replicated simulations under a completion time constraint
- Using Common Random Numbers for Indifference-Zone Selection and Multiple Comparisons in Simulation
- Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
- Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
This page was built for publication: Efficient Ranking and Selection in Parallel Computing Environments
