Selection of the Most Probable Best
提出最可能最优（MPB）作为新估计量，在模型不确定性由参数后验分布刻画时，通过有限支撑后验下的收敛率分析，设计序贯抽样算法以高效选择MPB，仿真表现优于基准方法。
In practice, simulation parameters are estimated from finite data, which introduces model uncertainty. In “Selection of the Most Probable Best,” Taeho Kim, Kyoung-Kuk Kim, and Eunhye Song propose a new estimator of the optimum, the most probable best (MPB), for ranking and selection (R&S) when the model uncertainty is characterized by a posterior distribution on the parameter given data. Defined as the solution with the largest posterior probability of optimality, selecting the MPB requires simulating at all parameter-solution combinations. The authors focus on when the posterior has a finite support and derive the convergence rate of the probability of correctly selecting the MPB as a function of sampling fractions of all solution-parameter pairs. They propose a lower bound on the rate function that allows easier characterization of the optimal sampling fractions and devise a sequential sampling algorithm from it. The algorithm shows superior empirical performance over benchmarks.