Optimal Full Matching and Related Designs via Network Flows
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
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“Although community trials are common in epidemiologic research, such studies tend to be based on a small number of neighborhoods, and often the intervention is not randomly assigned (24)(25)(26).”
From Reducing Violence by Transforming Neighborhoods: A Natural Experiment in Medellin, Colombia (2012) · cites this paper as [24]
Citations
Cites
(1990) · Choice Reviews Online · doi:10.5860/choice.27-3338 · Cited by 35,305
Hierarchical Linear Models: Applications and Data Analysis Methods.
Longford, N. T., Bryk, A. S., & Raudenbush, S. W. (1993) · Contemporary Sociology · doi:10.2307/2075823 · Cited by 18,724 · cited 2×
“Provided that there are nonisolated units, some full matching in Rosenbaum’s (1991) unrestricted sense always exists.”
BackgroundStatistical Aspects of the Analysis of Data From Retrospective Studies of Disease
(1959) · JNCI: Journal of the National Cancer Institute · doi:10.1093/jnci/22.4.719 · Cited by 14,689 · cited 1×
“The first of these side effects precludes the proper use of existing statistical methods for matched or stratified data, such as permutation inference (Mantel and Haenszel 1959; Hodges and Lehmann 1963; Rosenbaum 2002b, chap.”
MethodHapeman, D. E. (1991) · Technometrics · doi:10.1080/00401706.1991.10484817 · Cited by 9,373
Network Flows: Theory, Algorithms, and Applications.
Smith, D. K., Ahuja, R. K., Magnanti, T. L., & Orlin, J. B. (1994) · The Journal of the Operational Research Society · doi:10.2307/2583863 · Cited by 8,034 · cited 2×
“…algorithms work in pseudopolynomial time, meaning that the number of computations required to execute them is bounded by a polynomial in the number of nodes, N , the number of arcs,A, the greatest arc cost,C, and the largest absolute supply at an arc (Ahuja, Magnanti, and Orlin 1993, p. 340).”
BackgroundMatching as an econometric evaluation estimator: Evidence from evaluating a job training programme
Heckman, J. J., Ichimura, H., & Todd, P. E. (1997) · The Review of Economic Studies · doi:10.2307/2971733 · Cited by 5,486 · cited 2×
“…in this example are common in propensity-score matching, since in fitting the propensity score prior to matching, one in effect does one’s best to separate treated and controls groups on a linear covariate index; see, for instance, Heckman, Ichimura, and Todd (1997) or Dehejia and Wahba (1999).”
BackgroundRosenbaum, P. R., & Rubin, D. B. (1985) · The American Statistician · doi:10.2307/2683903 · Cited by 4,774 · cited 2×
“See Rosenbaum and Rubin (1985a), Rubin (1979), Olsen (1997), and Rubin and Thomas (2000) for some examples and properties.”
BackgroundMatching as Nonparametric Preprocessing for Reducing Model Dependence in Parametric Causal Inference
Ho, D. E., Imai, K., King, G., & Stuart, E. A. (2007) · Political Analysis · doi:10.1093/pan/mpl013 · Cited by 4,205 · cited 2×
“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.”
BackgroundMethodJournal of the Royal Statistical Society.
(1923) · The Economic Journal · doi:10.1093/ej/33.130.269 · Cited by 3,219
Does matching overcome lalonde’s critique of nonexperimental estimators?
A. Smith, J., & E. Todd, P. (2005) · Journal of Econometrics · doi:10.1016/j.jeconom.2004.04.011 · Cited by 3,176
Research works printed but not linked: 6
- Cochran W. G., 1973, Sankhy-a, Series A, Indian Journal of Statistics, 35, 417
- 10.1001/jama.276.11.889 · doi:10.1001/jama.276.11.889 · Paper page
- 10.2307/2669919 · doi:10.2307/2669919 · Paper page
- 10.2307/1390693 · DOI
- Ho D. E., 2005, The Yale Law Journal, 114, 1997
- 10.2307/2683903 · doi:10.2307/2683903 · Paper page
Cited by
Austin, P. C. (2011) · Multivariate Behavioral Research · doi:10.1080/00273171.2011.568786 · Cited by 12,242
“In R, the Matching (Sekhon, in press), MatchIt (Ho, Imai, King, & Stuart, 2011), and Optmatch (Hansen & Klopfer, 2006) packages allow one to implement a variety of different matching methods.”
BackgroundSekhon, J. S. (2011) · Journal of Statistical Software · doi:10.18637/jss.v042.i07 · Cited by 1,543
“Alternatively one can do optimal full matching (Hansen 2004; Hansen and Klopfer 2006; Rosenbaum 1989, 1991) instead of the 1-to-N matching with replacement which I focus on in this article.”
MatchIt: Nonparametric Preprocessing for Parametric Causal Inference
Ho, D., Imai, K., King, G., Stuart, E., & Greifer, N. (2005) · CRAN: Contributed Packages · doi:10.32614/cran.package.matchit · Cited by 1,206
Bayesian Nonparametric Modeling for Causal Inference
Hill, J. L. (2011) · Journal of Computational and Graphical Statistics · doi:10.1198/jcgs.2010.08162 · Cited by 1,139
“…comprise combinations of the following features: (1) matching method (nearest neighbor, optimal pairmatching, and full matching (Rosenbaum 1991; Hansen and Klopfer 2006)), (2) ratio of treated to control (1:1, 1:2, 1:3), (3) matching with or without replacement, and (4) method for estimating…”
BackgroundMethodDiamond, A., & Sekhon, J. S. (2013) · Review of Economics and Statistics · doi:10.1162/rest_a_00318 · Cited by 1,102
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
- Publisher
- Informa UK Limited
- 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.