Asymptotic Optimality of Myopic Ranking and Selection Procedures

by   Yanwen Li, et al.

Ranking and selection (R S) is a popular model for studying discrete-event dynamic systems. It aims to select the best design (the design with the largest mean performance) from a finite set, where the mean of each design is unknown and has to be learned by samples. Great research efforts have been devoted to this problem in the literature for developing procedures with superior empirical performance and showing their optimality. In these efforts, myopic procedures were popular. They select the best design using a 'naive' mechanism of iteratively and myopically improving an approximation of the objective measure. Although they are based on simple heuristics and lack theoretical support, they turned out highly effective, and often achieved competitive empirical performance compared to procedures that were proposed later and shown to be asymptotically optimal. In this paper, we theoretically analyze these myopic procedures and prove that they also satisfy the optimality conditions of R S, just like some other popular R S methods. It explains the good performance of myopic procedures in various numerical tests, and provides good insight into the structure and theoretical development of efficient R S procedures.


page 1

page 2

page 3

page 4


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

Large-scale ranking and selection (R S), which aims to select the best...

Efficient Fully Sequential Indifference-Zone Procedures Using Properties of Multidimensional Brownian Motion Exiting a Sphere

We consider a ranking and selection (R S) problem with the goal to sel...

Convergence Rate Analysis for Optimal Computing Budget Allocation Algorithms

Ordinal optimization (OO) is a widely-studied technique for optimizing d...

Have we been Naive to Select Machine Learning Models? Noisy Data are here to Stay!

The model selection procedure is usually a single-criterion decision mak...

Review on Ranking and Selection: A New Perspective

In this paper, we briefly review the development of ranking-and-selectio...

Lookahead and Hybrid Sample Allocation Procedures for Multiple Attribute Selection Decisions

Attributes provide critical information about the alternatives that a de...

Top-Two Thompson Sampling for Contextual Top-mc Selection Problems

We aim to efficiently allocate a fixed simulation budget to identify the...

Please sign up or login with your details

Forgot password? Click here to reset