Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
From MaRDI portal
Recommendations
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Efficient ranking and selection in parallel computing environments
- On parallel policies for ranking and selection problems
- Parallel matching for ranking all teams in a tournament
- Combined variance reduction techniques in fully sequential selection procedures
Cites work
- A fully sequential elimination procedure for indifference-zone ranking and selection with tight bounds on probability of correct selection
- A fully sequential procedure for indifference-zone selection in simulation
- A Knowledge-Gradient Policy for Sequential Information Collection
- A Sequential Procedure for Selecting the Population with the Largest Mean from k Normal Populations
- A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances
- Efficient ranking and selection in parallel computing environments
- Fully sequential indifference‐zone selection procedures with variance‐dependent sampling
- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Handbooks in operations research and management science: Simulation
- scientific article; zbMATH DE number 2089367 (Why is no real title available?)
- scientific article; zbMATH DE number 3527652 (Why is no real title available?)
- Indifference-Zone-Free Selection of the Best
- Introduction to algorithms
- On two-stage selection procedures and related probability-inequalities
- Ranking and Selection as Stochastic Control
- Sequential selectiok procedures based on confidence sequences for normal populations
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- The knowledge-gradient policy for correlated normal beliefs
- Using Common Random Numbers for Indifference-Zone Selection and Multiple Comparisons in Simulation
- Who can win a single-elimination tournament?
Cited in
(16)- Fully sequential procedures for large-scale ranking-and-selection problems in parallel computing environments
- Non-parametric procedure for knockout tournaments
- Efficient ranking and selection in parallel computing environments
- Solving Large-Scale Fixed-Budget Ranking and Selection Problems
- Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
- Ranking and selection for pairwise comparison
- Parallel Adaptive Survivor Selection
- Using cache or credit for parallel ranking and selection
- Marginal improvement procedures for top-\(m\) selection
- Simulation budget allocation for improving scheduling and routing of automated guided vehicles in warehouse management
- Blackbox simulation optimization
- Review of large-scale simulation optimization
- Adaptive sequential selection procedures for optimal quantile with control variates
- A budget-adaptive allocation rule for optimal computing budget allocation
- A simulation optimization approach for weight valuation in analytic hierarchy process
- Fifty years of stochastic simulation: where we are and where we need to go
This page was built for publication: Knockout-tournament procedures for large-scale ranking and selection in parallel computing environments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5031020)
