We consider a ranking and selection (R&S) problem with the goal to select a system with the largest or smallest expected performance measure among a number of simulated systems with a pre-specified probability of correct selection. Fully sequential procedures take one observation from each survived system and eliminate inferior systems when there is clear statistical evidence that they are inferior. Most fully sequential procedures make elimination decisions based on sample performances of each possible pair of survived systems and exploit the bound crossing properties of a univariate Brownian motion. In this paper, we present new fully sequential procedures with elimination decisions that are based on sample performances of all competing systems. Using properties of a multidimensional Brownian motion exiting a sphere, we derive heuristics that aim to achieve a given target probability of correct selection. We show that in practice the new procedures significantly outperform a widely used fully sequential procedure. Compared to BIZ, a recent fully-sequential procedure that uses statistics inspired by Bayes posterior probabilities, our procedures have better performance under difficult mean or variance configurations but similar performance under easy mean configurations.
翻译:我们考虑一个等级和选择(R&S)问题,目标是在一系列模拟系统中选择一个具有最大或最小预期性能测量的系统,这些系统具有预先规定的正确选择概率。完整顺序程序从每个幸存的系统中进行一项观察,并在有明确的统计证据表明这些系统是低劣的时消除低劣系统。大多数完全顺序程序根据每对可能的幸存系统的抽样性能作出消除决定,并利用一项单一的Brownian动议的交错性能。在本文件中,我们提出了新的全顺序程序,根据所有竞合系统的抽样性能作出消除决定。我们利用多维的Brown运动的特性,得出旨在达到正确选择特定目标概率的超常性工作。我们表明,在实际中,新程序大大超越了广泛使用的全顺序程序。与BIZ相比,最近采用完全顺序程序,使用由Bayes后方概率所启发的统计数据,我们的程序在最困难的中或差异性能较好,但在简单平均配置下进行类似的性能。