Algorithm for Calculating the Initial Sample Size in a Fully Sequential Ranking and Selection Procedure

Ranking and selection (R&S) aims to select the best alternative with the largest mean performance from a finite set of alternatives. Recently, considerable attention has turned toward the large-scale R&S problem which involves a large number of alternatives. Ideal large-scale R&S procedures should be sample optimal; that is, the total sample size required to deliver an asymptotically nonzero probability of correct selection (PCS) grows at the minimal order (linear order) in the number of alternatives, k. Surprisingly, we discover that the naïve greedy procedure, which keeps sampling the alternative with the largest running average, performs strikingly well and appears sample optimal. To understand this discovery, we develop a new boundary-crossing perspective and prove that the greedy procedure is sample optimal for the scenarios where the best mean maintains at least a positive constant away from all other means as k increases. We further show that the derived PCS lower bound is asymptotically tight for the slippage configuration of means with a common variance. For other scenarios, we consider the probability of good selection and find that the result depends on the growth behavior of the number of good alternatives: if it remains bounded as k increases, the sample optimality still holds; otherwise, the result may change. Moreover, we propose the explore-first greedy procedures by adding an exploration phase to the greedy procedure. The procedures are proven to be sample optimal and consistent under the same assumptions. Last, we numerically investigate the performance of our greedy procedures in solving large-scale R&S problems. This paper was accepted by Baris Ata, stochastic models and simulation. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72091211, 72071146, 72161160340]. Supplemental Material: The e-companion and data files are available at https://doi.org/10.1287/mnsc.2023.00694 .

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Algorithm for Calculating the Initial Sample Size in a Fully Sequential Ranking and Selection Procedure

Cited by 2 publications

References 22 publications

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

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

The (Surprising) Sample Optimality of Greedy Procedures for Large-Scale Ranking and Selection

Contact Info

Product

Resources

About