Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee

DOI10.1016/j.orl.2020.11.004OpenAlexW3104425725MaRDI QIDQ2661587

Ying Zhong, Xiaojuan Puyang

Publication date: 7 April 2021

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2020.11.004

zbMATH Keywords

asymptotic efficiency analysisPaulson's procedureprobably approximately correct guaranteeranking-and-selection

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

On the finite-sample statistical validity of adaptive fully sequential procedures

Cites Work

• Fully Sequential Procedures for Large-Scale Ranking-and-Selection Problems in Parallel Computing Environments
• Sequential selectiok procedures based on confidence sequences for normal populations
• 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
• A Sequential Procedure for Selecting the Population with the Largest Mean from $k$ Normal Populations
• A Comparison of the Asymptotic Expected Sample Sizes of Two Sequential Procedures for Ranking Problem
• A Single-Sample Multiple Decision Procedure for Ranking Means of Normal Populations with known Variances

This page was built for publication: Asymptotic efficiency analysis on the modified Paulson's procedure with a PAC guarantee