A Note on Optimal Matching With Variable Controls Using the Assignment Algorithm
- 1 September 2001
- journal article
- research article
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 10 (3) , 455-463
- https://doi.org/10.1198/106186001317114938
Abstract
The assignment algorithm is an old, well-known, widely implemented, fast, combinatorial algorithm for optimal matching in a bipartite graph. This note proposes a method for using the assignment alg...Keywords
This publication has 18 references indexed in Scilit:
- Substantial Gains in Bias Reduction from Matching with a Variable Number of ControlsBiometrics, 2000
- Power and Sample Size for Matched Case-Control StudiesPublished by JSTOR ,1996
- Comparison of Multivariate Matching Methods: Structures, Distances, and AlgorithmsJournal of Computational and Graphical Statistics, 1993
- Hospital and Patient Characteristics Associated With Death After SurgeryMedical Care, 1992
- Optimal Matching for Observational StudiesJournal of the American Statistical Association, 1989
- Constructing a Control Group Using Multivariate Matched Sampling Methods That Incorporate the Propensity ScoreThe American Statistician, 1985
- Prognostic importance of anginal symptoms in angiographically defined coronary artery diseaseThe American Journal of Cardiology, 1981
- Coffee and Myocardial InfarctionNew England Journal of Medicine, 1973
- Matching to Remove Bias in Observational StudiesPublished by JSTOR ,1973
- The Hungarian method for the assignment problemNaval Research Logistics Quarterly, 1955