Tools for large, sparse optimal matching of treated units and control units in observational studies. Provisions are made for refined covariate balance constraints, which include fine and near-fine balance as special cases. Matches are optimal in the sense that they are computed as solutions to network optimization problems rather than greedy algorithms.
|Author||Samuel D. Pimentel|
|Date of publication||2016-08-16 09:55:03|
|Maintainer||Samuel D. Pimentel <email@example.com>|
|License||MIT + file LICENSE|
build.dist.struct: Build Distance Structure for Matching with Refined Balance
callrelax: Solve Network Flow Problem using RELAX-IV Algorithm
count.pairings: Count treatment-control pairings.
dist2net: Building and Manipulating Network Flow Problems
rcbalance: Optimal Matching with Refined Covariate Balance
rcbalance-package: Sparse Optimal Matching with Refined Covariate Balance
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.