This package extends optimal matching functionality to cases where enrollment in the treatment is rolling. As such, this package only slightly modifies the {optmatch} package and acknowledges a heavy debt to its authors: Ben B. Hansen, Mark Fredrickson, Josh Buckner, Josh Errickson, Adam Rauh, and Peter Solenberger. Like {optmatch}, GroupMatch uses the RELAXIV minimum cost flow solver due to Dimitri P. Bertsekas and Paul Tseng to solve a representation of the matching problem as a network flow. It is possible to combine this representation of the matching problem with standard constraints, such as calipers or exactmatching, to improve balance or create a stratified matching problem.
Package details 


Author  Jonathan Gellar, Ben B. Hansen, Mark Fredrickson, Amanda Glazer, Lauren Forrow, Sam Pimentel 
Maintainer  Jonathan Gellar <jgellar@mathematicampr.com> 
License  MIT + file LICENSE 
Version  0.1.0 
Package repository  View on GitHub 
Installation 
Install the latest version of this package by entering the following in R:

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.