Skip to main content
Log in

An adaptive algorithm for estimating inclusion probabilities and performing the Horvitz–Thompson criterion in complex designs

  • Original Paper
  • Published:
Computational Statistics Aims and scope Submit manuscript

Abstract

An algorithm for estimating inclusion probabilities and applying the Horvitz–Thompson criterion is considered for complex sampling designs, when the computation of the actual inclusion probabilities is prohibitive. The inclusion probabilities are estimated by means of independent replications of the sampling scheme. In turn, the number of replications is determined on the basis of the stability of the resulting estimates as well as on the basis of their precision, checked by means of the Bennet inequality. The number of replications is adaptively increased until a suitable level of precision is reached in a sustainable computational time. Details on the FORTRAN routines adopted for implementing the algorithm are given. The procedure is checked using three artificial examples.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lorenzo Fattorini.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Fattorini, L. An adaptive algorithm for estimating inclusion probabilities and performing the Horvitz–Thompson criterion in complex designs. Comput Stat 24, 623–639 (2009). https://doi.org/10.1007/s00180-009-0149-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00180-009-0149-9

Keywords

Navigation