4.3 Article Book Chapter

Modern Algorithms for Matching in Observational Studies

Publisher

ANNUAL REVIEWS
DOI: 10.1146/annurev-statistics-031219-041058

Keywords

assignment algorithm; causal inference; design sensitivity; integer programming; fine balance; Mahalanobis distance; near-fine balance; network optimization; optimal matching; principal unobserved covariate; propensity score; refined balance; sensitivity analysis

Ask authors/readers for more resources

Using a small example as an illustration, this article reviews multivariate matching from the perspective of a working scientist who wishes to make effective use of available methods. The several goals of multivariate matching are discussed. Matching tools are reviewed, including propensity scores, covariate distances, fine balance, and related methods such as near-fine and refined balance, exact and near-exact matching, tactics addressing missing covariate values, the entire number, and checks of covariate balance. Matching structures are described, such as matching with a variable number of controls, full matching, subset matching and risk-set matching. Software packages in R are described. A brief review is given of the theory underlying propensity scores and the associated sensitivity analysis concerning an unobserved covariate omitted from the propensity score.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.3
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available