Solving Large-Scale Fixed-Budget Ranking and Selection Problems
From MaRDI portal
Publication:5060777
DOI10.1287/ijoc.2022.1221OpenAlexW4288080706MaRDI QIDQ5060777
Guang-Xin Jiang, L. Jeff Hong, Ying Zhong
Publication date: 11 January 2023
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2022.1221
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulation budget allocation for further enhancing the efficiency of ordinal optimization
- Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
- Sequential Sampling to Myopically Maximize the Expected Value of Information
- Indifference-Zone-Free Selection of the Best
- On the Convergence Rates of Expected Improvement Methods
- A Confidence Interval Procedure for Expected Shortfall Risk Measurement via Two-Level Simulation
- A Knowledge-Gradient Policy for Sequential Information Collection
- On two-stage selection procedures and related probability-inequalities
- A fully sequential procedure for indifference-zone selection in simulation
- Efficient Ranking and Selection in Parallel Computing Environments
- Knockout-Tournament Procedures for Large-Scale Ranking and Selection in Parallel Computing Environments
- Ranking and Selection with Covariates for Personalized Decision Making
- Speeding Up Paulson’s Procedure for Large-Scale Problems Using Parallel Computing
- 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
This page was built for publication: Solving Large-Scale Fixed-Budget Ranking and Selection Problems
