Abstract
Abstract This article investigates the sampling effort required to obtain matches for all members of a given sample. The exact distribution of the sample size required to complete the match quotas in all categories of the matching variable(s) is derived; the first two moments are also derived recursively, using a Markov chain approach. For problems with equal quotas in equiprobable categories, these moments may be computed as functions of gamma and normal order statistic moments. Numerical results are given to characterize the feasibility of matching in relation to the study size, the number of matching categories, and the distributions of the category probabilities and quotas.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
