ON SELECTING THE PARETO-OPTIMAL SUBSET OF A CLASS OF POPULATIONS

被引:1
作者
SOBEL, M [1 ]
机构
[1] TEMPLE UNIV,DEPT STAT,PHILADELPHIA,PA 19122
关键词
D O I
10.1080/03610929208830832
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Let P be a class of k populations (with k known) each having an underlying multivariate normal distribution with unknown mean vector. We suppose that the mean (vector) value of each population can be represented by a vector parameter with p components and use the notation M to denote the set of all mean vectors for these k populations. Independent samples of size n are drawn from each population in P. We say that a subset G of P of vectors is delta*-Pareto-optimal if no vector in M, differing in at least one component from some mean vector-mu corresponding to a population in G, has the property that each of its components is larger by at least delta* > 0 than the corresponding component of the vector-mu. In this paper we evaluate procedures devised to select the delta*-Pareto-Optimal subset of a class of populations according to the minimum probability of correct selection over a region of the parameter space which we call the preference zone. For small values of k, theoretical calculations are given to analyze how big a sample size n is needed to bound the minimum probability of correct selection below by a preassigned value P*. We usually take P* close to 1 (say .90 or .95), although theoretically we only need to have P* > 1/(2k - 1). For larger values of k, we construct an algorithm and also some computer simulation to show how this can be done.
引用
收藏
页码:1085 / 1102
页数:18
相关论文
共 6 条
  • [1] [Anonymous], 1979, MULTIPLE DECISION PR
  • [2] Feller W., 1968, INTRO PROBABILITY TH
  • [3] Gibbons J.D., 1977, SELECTING ORDERING P
  • [4] Karlin S., 1959, MATH METHODS THEORY
  • [5] Kelley J.L., 1955, GEN TOPOLOGY
  • [6] Luce R. D., 1957, GAMES DECIS