Algorithms and Complexities of Matching Variants in Covariate Balancing

DOI10.1287/OPRE.2022.2286MaRDI QIDQ6195080zbMATH OpenOpenAlexFDO

Authors Dorit S. Hochbaum, Asaf Levin, Xu Rao

Publication date 12 March 2024

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2022.2286

zbMATH Keywords

algorithmscomplexitycovariate balancematchingobservational studies

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• Network flow methods for the minimum covariate imbalance problem
• On the support of matching algorithms
• Complexity and approximation results for the balance optimization subset selection model for causal inference in observational studies
• Selecting intervals to optimize the design of observational studies subject to fine balance constraints
• How Well Can Fine Balance Work for Covariate Balancing

This page was built for publication: Algorithms and Complexities of Matching Variants in Covariate Balancing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6195080)