CoChat

Optimal Full Matching and Related Designs via Network Flows

Hansen, Ben B, Klopfer, Stephanie Olsen · 2006 · Journal of Computational and Graphical Statistics

The DOI matches its Crossref record; 37 of the 39 references it cites were found in a registry or an index.

Abstract

In the matched analysis of an observational study, confounding on covariates X is addressed by comparing members of a distinguished group (Z = 1) to controls (Z = 0) only when they belong to the same matched set. The better matchings, therefore, are those whose matched sets exhibit both dispersion in Z and uniformity in X. For dispersion in Z, pair matching is best, creating matched sets that are equally balanced between the groups; but actual data place limits, often severe limits, on matched pairs' uniformity in X. At the other extreme is full matching, the matched sets of which are as uniform in X as can be, while often so poorly dispersed in Z as to sacrifice efficiency.This article presents an algorithm for exploring the intermediate territory. Given requirements on matched sets' uniformity in X and dispersion in Z, the algorithm first decides the requirements' feasibility. In feasible cases, it furnishes a match that is optimal for X-uniformity among matches with Z-dispersion as stipulated. To illustrate, we describe the algorithm's use in a study comparing womens' to mens' working conditions; and we compare our method to a commonly used alternative, greedy matching, which is neither optimal nor as flexible but is algorithmically much simpler. The comparison finds meaningful advantages, in terms of both bias and efficiency, for our more studied approach.

Overview

Integrity signals

Registry

Crossref · 10.1198/106186006x137047

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 37 references

Research works printed but not linked: 6

  1. Cochran W. G., 1973, Sankhy-a, Series A, Indian Journal of Statistics, 35, 417
  2. 10.1001/jama.276.11.889 · doi:10.1001/jama.276.11.889 · Paper page
  3. 10.2307/2669919 · doi:10.2307/2669919 · Paper page
  4. 10.2307/1390693 · DOI
  5. Ho D. E., 2005, The Yale Law Journal, 114, 1997
  6. 10.2307/2683903 · doi:10.2307/2683903 · Paper page

Cited by

See all 715

Metadata

Authors
Hansen, B. B., & Klopfer, S. O.
Affiliations
  • University of Michigan (US)
  • Merck & Co., Inc., Rahway, NJ, USA (United States) (US)
Venue
Journal of Computational and Graphical Statistics
Published
2006-09
Volume
15
Issue
3
Pages
609-627
ISSN
  • 1061-8600 (ISSN-L)
  • 1537-2715
OpenAlex
W2122771444
Cited by
703
References
39
Citations by year
2026: 46 · 2025: 58 · 2024: 68 · 2023: 60 · 2022: 68 · 2021: 60 · 2020: 70 · 2019: 29 · 2018: 30 · 2017: 37 · 2016: 34 · 2015: 38 · 2014: 17 · 2013: 23 · 2012: 19
FWCI
5.01
Type
journal article
Language
en
Open access
closed
Locations
Journal of Computational and Graphical Statistics (publishedVersion)
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Advanced Causal Inference Techniques
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Optimal Experimental Design Methods
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods in Clinical Trials
Keywords
matched analysis, observational studies, confounding, covariate balance, network flow, matching algorithms, greedy matching

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: Optimal Full Matching and Related Designs via Network Flows. https://app.cochat.ai/papers/10.1198/106186006x137047
The paper
Hansen, B. B., & Klopfer, S. O. (2006). Optimal Full Matching and Related Designs via Network Flows. Journal of Computational and Graphical Statistics. https://doi.org/10.1198/106186006x137047

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.