Complexity and Approximation Results for the Balance Optimization Subset Selection Model for Causal Inference in Observational Studies
DOI10.1287/ijoc.2013.0583zbMath1304.62139MaRDI QIDQ2940541
Jacobson, Sheldon H., Edward C. Sewell, Jason J. Sauppe
Publication date: 27 January 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2013.0583
computational complexity; matching; mixed integer programming; observational studies; approximation algorithms; causal inference; fine balance; comparative effectiveness research; balance optimization
62P10: Applications of statistics to biology and medical sciences; meta analysis
62K99: Design of statistical experiments
62D05: Sampling theory, sample surveys
90C90: Applications of mathematical programming
92C50: Medical applications (general)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covariate balance in simple, stratified and clustered comparative studies
- Optimal Matching with Minimal Deviation from Fine Balance in a Study of Obesity and Surgical Outcomes
- A threshold of ln n for approximating set cover
- The central role of the propensity score in observational studies for causal effects
- Bias Reduction Using Mahalanobis-Metric Matching
- An analysis of approximations for maximizing submodular set functions—I
- Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure After Surgery
- Multivariate Matching Methods That Are Monotonic Imbalance Bounding
- Balance Optimization Subset Selection (BOSS): An Alternative Approach for Causal Inference with Observational Data
- Minimum Distance Matched Sampling With Fine Balance in an Observational Study of Treatment for Ovarian Cancer
- Maximum matching and a polyhedron with 0,1-vertices
