Abstract
In this note, we consider the statistical ranking and selection problem of finding the best alternative when the performances of each alternative must be estimated by sampling. We provide a myopic allocation policy that asymptotically achieves the sampling ratios given by the optimal computing budget allocation, an approximate solution of the optimal large deviations rate for the decreasing probability of false selection. We analyze the asymptotic sampling ratio for both known variances and unknown variances under a Bayesian framework. Numerical results substantiate the theoretical results.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
