Group-matching algorithms for subjects and items

10/09/2021
by   Géza Kiss, et al.
0

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.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

01/06/2021

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

dame-flame is a Python package for performing matching for observational...
05/20/2021

Matchings with Group Fairness Constraints: Online and Offline Algorithms

We consider the problem of assigning items to platforms in the presence ...
07/19/2017

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

A classical problem in causal inference is that of matching, where treat...
05/30/2020

Bi-Criteria Multiple Knapsack Problem with Grouped Items

The multiple knapsack problem with grouped items aims to maximize reward...
09/21/2020

Flexibility can hurt dynamic matching system performance

We study the performance of general dynamic matching models. This model ...
10/22/2019

Deep Set-to-Set Matching and Learning

Matching two sets of items, called set-to-set matching problem, is being...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.