Published online by Cambridge University Press: 01 January 2025
A matching procedure is proposed by which a judge may use the same items in different matches. The K items in one group most likely to include the correct match with each item in the other are selected. Inclusion of the correct match among the K items chosen is defined as a success. The distribution of the number of successes is discussed. Tables are presented showing the number of successes needed for significance for various values of K and of N, the number of items in each group.