Abstract
Here, we study several variants of matching problems that arise in covariate balancing. Covariate balancing problems can be viewed as variants of matching, or b-matching, with global side constraints. We present here a comprehensive complexity study of the covariate balancing 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.
| Original language | English |
|---|---|
| Pages (from-to) | 1800-1814 |
| Number of pages | 15 |
| Journal | Operations Research |
| Volume | 71 |
| Issue number | 5 |
| DOIs | |
| State | Published - 1 Sep 2023 |
Keywords
- algorithms
- complexity
- covariate balance
- matching
- observational studies
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research
Fingerprint
Dive into the research topics of 'Algorithms and Complexities of Matching Variants in Covariate Balancing'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver