We examine the selection of jurors' names from multiple source lists, using statistical and optimization methodology. Five plans for sampling at random from overlapping lists of names are analyzed for their probabilistic and cost properties. In each plan the probability of a name being selected is independent of which and how many lists it appears on. We consider the optimal ordering of the frames to minimize cost and develop a heuristic for solving this problem. Although the methods are discussed in terms of juror selection, the results apply to sampling from overlapping frames in any context. For instance, if lists of equipment are kept according to possible uses, with versatile equipment listed many times, the methods of this paper can be used to draw a random sample of equipment to check for readiness.
[1]
T. Koopmans,et al.
Assignment Problems and the Location of Economic Activities
,
1957
.
[2]
P. Gilmore.
Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
,
1962
.
[3]
Wayne E. Smith.
Various optimizers for single‐stage production
,
1956
.
[4]
Paul S. Levy,et al.
Multiplicity Estimation of Proportions Based on Ratios of Random Variables
,
1974
.
[5]
Leo A. Goodman,et al.
On the Analysis of Samples from $k$ Lists
,
1952
.
[6]
E. Lawler.
The Quadratic Assignment Problem
,
1963
.
[7]
W. Deming,et al.
On the Problem of Matching Lists by Samples
,
1959
.