CoChat

A Constructive Procedure for Unbiased Controlled Rounding

Cox, Lawrence H. · 1987 · Journal of the American Statistical Association
Cited by 113

The DOI matches its Crossref record.

Abstract

It is often necessary to round values in a two-way statistical table, that is, replace each value by an adjacent integer multiple of an appropriately chosen integer rounding base. Such is the case when statistical data are to be presented in increments, such as personal income presented in multiples of $1,000 or retail sales in units of $1 million, or when counts must be adjusted prior to release to reduce the risk of statistical disclosure (Cox, McDonald, and Nelson 1986). It is desirable that the rounded array also be additive along rows and columns and to the grand total. A table satisfying these conditions is called a controlled rounding of the original table. If, as is often the case, entries that are already integer multiples of the base must remain unchanged, the controlled rounding is said to be zero-restricted. Controlled rounding is an important adjunct to statistical methods for adjusting contingency tables such as iterative proportional fitting (Ireland and Kullback 1968), because such methods often do not converge to additive, integer-valued tables as required. It is also desirable that the rounding procedure be unbiased. Nargundkar and Saveland (1972) developed unbiased (so-called “random”) rounding procedures, which Fellegi (1975) was able to make additive, but only for one-way tables. Unbiased controlled rounding is especially useful in sampling and estimation problems. Indeed, the controlled selection problem in two-way stratification (Goodman and Kish 1950) amounts to finding an unbiased controlled rounding (base 1) of the table of expected sample sizes. Cox and Ernst (1982) demonstrated that for any two-way table controlled roundings to any base always exist, and presented methods for finding controlled roundings optimally close to the original table. Causey, Cox, and Ernst (1985) extended these results to produce unbiased controlled roundings, thereby solving the controlled selection problem. These methods rely upon mathematical programming algorithms that, although efficient, are complex. In this article I present a constructive algorithm for achieving unbiased controlled rounding that is simple enough to be implemented by hand. Extension of this method to the larger problem of achieving balanced adjustments in tables is easily seen, thereby demonstrating that random perturbation methods for controlling statistical disclosure (Newman 1975), heretofore not additive, can be made additive. The controlled rounding problem in three dimensions is discussed and a counterexample to the existence of unbiased controlled rounding in three dimensions is given.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1080/01621459.1987.10478456

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 113

Metadata

Authors
Cox, L. H.
Venue
Journal of the American Statistical Association
Published
1987-06
Volume
82
Issue
398
Pages
520-524
ISSN
  • 0162-1459 (ISSN-L)
  • 1537-274X
OpenAlex
W2086314067
Cited by
113
References
0
FWCI
2.84
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: A Constructive Procedure for Unbiased Controlled Rounding. https://app.cochat.ai/papers/10.1080/01621459.1987.10478456
The paper
Cox, L. H. (1987). A Constructive Procedure for Unbiased Controlled Rounding. Journal of the American Statistical Association. https://doi.org/10.1080/01621459.1987.10478456

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.