Some recent algorithms for sampling without replacement with unequal probabilities

The author gives a general formulation of the problem of sampling without replacement with unequal probabilities from a finite population. He presents some desiderata which a ‘good method’ should fulfil. He then describes several recent methods some of which are not yet published in extenso and discusses a few general results concerning sampling algorithms which show some incompatibilities of the properties.