Group-matching algorithms for subjects and items

by   Géza Kiss, et al.

We consider the problem of constructing matched groups such that the resulting groups are statistically similar with respect to their average values for multiple covariates. This group-matching problem arises in many cases, including quasi-experimental and observational studies in which subjects or items are sampled from pre-existing groups, scenarios in which traditional pair-matching approaches may be inappropriate. We consider the case in which one is provided with an existing sample and iteratively eliminates samples so that the groups "match" according to arbitrary statistically-defined criteria. This problem is NP-hard. However, using artificial and real-world data sets, we show that heuristics implemented by the ldamatch package produce high-quality matches.


page 1

page 2

page 3

page 4


dame-flame: A Python Library Providing Fast Interpretable Matching for Causal Inference

dame-flame is a Python package for performing matching for observational...

Matchings with Group Fairness Constraints: Online and Offline Algorithms

We consider the problem of assigning items to platforms in the presence ...

FLAME: A Fast Large-scale Almost Matching Exactly Approach to Causal Inference

A classical problem in causal inference is that of matching, where treat...

Bi-Criteria Multiple Knapsack Problem with Grouped Items

The multiple knapsack problem with grouped items aims to maximize reward...

Flexibility can hurt dynamic matching system performance

We study the performance of general dynamic matching models. This model ...

Matching with multiple criteria and its application to health disparities research

Matching is a popular nonparametric covariate adjustment strategy in emp...

Adaptive Sampling to Reduce Disparate Performance

Existing methods for reducing disparate performance of a classifier acro...

Please sign up or login with your details

Forgot password? Click here to reset