Algorithms and Complexity for Variants of Covariates Fine Balance

We study here several variants of the covariates fine balance problem where we generalize some of these problems and introduce a number of others. We present here a comprehensive complexity study of the covariates problems providing polynomial time algorithms, or a proof of NP-hardness. The polynomial time algorithms described are mostly combinatorial and rely on network flow techniques. In addition we present several fixed-parameter tractable results for problems where the number of covariates and the number of levels of each covariate are seen as a parameter.

[1]  Ravi Kannan,et al.  Improved algorithms for integer programming and related lattice problems , 1983, STOC.

[2]  Juan Pablo Vielma,et al.  Building Representative Matched Samples With Multi-Valued Treatments in Large Observational Studies , 2018, Journal of Computational and Graphical Statistics.

[3]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[4]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[5]  Richard M. Karp,et al.  Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems , 1972, Combinatorial Optimization.

[6]  Paul R. Rosenbaum,et al.  Overt Bias in Observational Studies , 2002 .

[7]  Mihalis Yannakakis,et al.  On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[8]  Donald B. Rubin,et al.  Affinely invariant matching methods with discriminant mixtures of proportional ellipsoidally symmetric distributions , 2006, math/0611263.

[9]  N. Tomizawa,et al.  On some techniques useful for solution of transportation network problems , 1971, Networks.

[10]  Mihalis Yannakakis,et al.  The complexity of restricted spanning tree problems , 1982, JACM.

[11]  Dylan S Small,et al.  Optimal Matching with Minimal Deviation from Fine Balance in a Study of Obesity and Surgical Outcomes , 2012, Biometrics.

[12]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[13]  Gary King,et al.  Matching as Nonparametric Preprocessing for Reducing Model Dependence in Parametric Causal Inference , 2007, Political Analysis.

[14]  Hendrik W. Lenstra,et al.  Integer Programming with a Fixed Number of Variables , 1983, Math. Oper. Res..

[15]  Dorit S. Hochbaum,et al.  Network Flow Methods for the Minimum Covariates Imbalance Problem , 2020, ArXiv.

[16]  J. Zubizarreta.  Journal of the American Statistical Association Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure after Surgery Using Mixed Integer Programming for Matching in an Observational Study of Kidney Failure after Surgery , 2022 .

[17]  J. Avorn,et al.  Variable selection for propensity score models. , 2006, American journal of epidemiology.

[18]  M. Iri.  A NEW METHOD OF SOLVING TRANSPORTATION· NETWORK PROBLEMS , 1960 .

[19]  P. Rosenbaum,et al.  Minimum Distance Matched Sampling With Fine Balance in an Observational Study of Treatment for Ovarian Cancer , 2007 .

[20]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[21]  Elizabeth A Stuart,et al.  Matching methods for causal inference: A review and a look forward. , 2010, Statistical science : a review journal of the Institute of Mathematical Statistics.

[22]  Samuel D. Pimentel,et al.  Large, Sparse Optimal Matching With Refined Covariate Balance in an Observational Study of the Health Outcomes Produced by New Surgeons , 2015, Journal of the American Statistical Association.