Abstract
AbstractMotivated by designing observational studies using matching methods subject to fine balance constraints, we introduce a new optimization problem. This problem consists of two phases. In the first phase, the goal is to cluster the values of a continuous covariate into a limited number of intervals. In the second phase, we find the optimal matching subject to fine balance constraints with respect to the new covariate we obtained in the first phase. We show that the resulting optimization problem is NP-hard. However, it admits an FPT algorithm with respect to a natural parameter. This FPT algorithm also translates into a polynomial time algorithm for the most natural special cases of the problem.
Funder
Israel Science Foundation
Technion - Israel Institute of Technology
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Ahyja RK, Orlin JB, Magnanti TL (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Hoboken
2. Ashlagi I, Saberi A, Shameli A (2020) Assignment mechanisms under distributional constraints. Oper Res 68(2):467–479
3. Garey MR, Johnson DS (1978) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman, New York
4. Hochbaum DS, Levin A (2018) Weighted matching with pair restrictions. Optim Lett 12(3):649–659
5. Hochbaum DS, Levin A, Rao X (2022a) Algorithms and complexities of matching variants in covariate balancing. Oper Res