Translator Disclaimer
March, 1984 Monotonicity in Selection Problems: A Unified Approach
Roger L. Berger, Frank Proschan
Ann. Statist. 12(1): 387-391 (March, 1984). DOI: 10.1214/aos/1176346417


Let $\mathbf{X} = (X_1,\cdots, X_n)$ have a density $g(\mathbf{x}, \lambda)$ which is decreasing in transposition, where $\lambda = (\lambda_1,\cdots, \lambda_n)$. Suppose one wishes to select a subset of $\{1,\cdots, n\}$ containing the subscripts associated with the largest values of the $\lambda_i$'s. Let $S$ be a permutation invariant selection rule which is more likely to select a subset associated with the largest values of the $X_i$'s. Let $A = \{i(1),\cdots, i(k)\} \subset \{1,\cdots, n\}$ and $B = \{j(1),\cdots, j(k)\} \subset \{1,\cdots, n\}$ be such that $\lambda_{i(s)} \geq \lambda_{j(s)}, s = 1,\cdots, k$. The following five inequalities are proved for nonrandomized selection rules. $(|D|$ denotes the number of elements in $D$. $D^c$ denotes the complement of $D$.) $P_\lambda(|S \cap A| \geq (>)m) \geq P(|S \cap B| \geq (>)m)$ for every $m \in R^1, P_\lambda(|S \cap A^c| \leq (<)m) \geq P_\lambda(|S \cap B^c| \leq (<)m)$ for every $m \in R^1$, and $P_\lambda(S = A) \geq P_\lambda(S = B)$. Inequalities for randomized selection rules are also obtained. These generalized monotonicity properties are derived using a unified approach. The results apply to selection rules proposed under several formulations of the selection problem.


Download Citation

Roger L. Berger. Frank Proschan. "Monotonicity in Selection Problems: A Unified Approach." Ann. Statist. 12 (1) 387 - 391, March, 1984.


Published: March, 1984
First available in Project Euclid: 12 April 2007

zbMATH: 0542.62017
MathSciNet: MR733524
Digital Object Identifier: 10.1214/aos/1176346417

Primary: 62F07
Secondary: 62H10

Rights: Copyright © 1984 Institute of Mathematical Statistics


Vol.12 • No. 1 • March, 1984
Back to Top