2004
DOI: 10.1093/biomet/91.4.893
|View full text |Cite
|
Sign up to set email alerts
|

Efficient balanced sampling: The cube method

Abstract: SA balanced sampling design is defined by the property that the Horvitz-Thompson estimators of the population totals of a set of auxiliary variables equal the known totals of these variables. Therefore the variances of estimators of totals of all the variables of interest are reduced, depending on the correlations of these variables with the controlled variables. In this paper, we develop a general method, called the cube method, for selecting approximately balanced samples with equal or unequal inclusio… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
193
0
4

Year Published

2005
2005
2020
2020

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 204 publications
(198 citation statements)
references
References 20 publications
1
193
0
4
Order By: Relevance
“…When a rounding problem is encountered, it is not possible to find a vector s of zeros and ones that exactly satisfies the equation Deville and Tillé (2004) proposed the cube method, which allows for the selection of balanced samples. The cube method is an algorithm composed of two phases: the flight phase and the landing phase.…”
Section: Balanced Samplingmentioning
confidence: 99%
See 2 more Smart Citations
“…When a rounding problem is encountered, it is not possible to find a vector s of zeros and ones that exactly satisfies the equation Deville and Tillé (2004) proposed the cube method, which allows for the selection of balanced samples. The cube method is an algorithm composed of two phases: the flight phase and the landing phase.…”
Section: Balanced Samplingmentioning
confidence: 99%
“…At the end of the landing phase, every unit has been selected or rejected. Deville and Tillé (2004) have proposed two ways of running the landing phase: by linear programming or by suppression of variables. The landing phase by linear programming consists of solving a linear programming problem through the simplex algorithm.…”
Section: Balanced Samplingmentioning
confidence: 99%
See 1 more Smart Citation
“…This method is divided into a ight phase and a landing phase (see Deville and Tillà e, 2002). Each phase can be applied with several options.…”
Section: Measure Of Accuracy Of the Approximations Of Variancementioning
confidence: 99%
“…A family of algorithms is available (Deville and Tillé, 2005a) to select a balanced random sample. It is thus possible to select at time t a sample, so that the identities…”
Section: Balanced Samplingmentioning
confidence: 99%