On constructing sequences estimating the mixing distribution with applications

This paper shows that by minimizing a Chebychev norm a mixing distribution can be constructed which converges weakly to the true mixing distribution with probability one. Deely and Kruse (1968) established a similar result for the supremum norm. For both norms the constructed mixing distribution is computed by solving a linear programming problem, but this problem is considerably smaller when the Chebychev norm is used. Thus a suitable mixing distribution can be constructed from solving a linear programming problem with considerably less computational work than was previously known. To illustrate the application of this simpler procedure it is applied to derive nonparametric empirical Bayes estimates in a simulation study. Some density estimates are also illustrated.