subproblemSuccess

The result of <code><a href="/link/fullmatch?package=optmatch&version=0.9-5" rd-options="" data-mini-rdoc="optmatch::fullmatch">fullmatch</a></code> or <code><a href="/link/pairmatch?package=optmatch&version=0.9-5" rd-options="" data-mini-rdoc="optmatch::pairmatch">pairmatch</a></code>.

<code><a href="/link/fullmatch?package=optmatch&version=0.9-5" rd-options="" data-mini-rdoc="optmatch::fullmatch">fullmatch</a></code> can break up a large matching problem into smaller
subproblems (for example, using strata defined by <code><a href="/link/exactMatch?package=optmatch&version=0.9-5" rd-options="" data-mini-rdoc="optmatch::exactMatch">exactMatch</a></code>).
This function lists the subproblems in a match and list whether at least on
treated unit was matched in subproblem. Subproblems that have no matched
treated units are said to have "failed."

Provides routines for distance based bipartite matching to reduce
    covariate imbalance between treatment and control groups in observational
    studies. Routines are provided to generate distances from GLM models (propensity
    score matching) and formulas (Euclidean and Mahalanobis matching), stratified
    matching (exact matching), and calipers. Results of the fullmatch routine are
    guaranteed to provide minimum average within matched set distance.

subproblemSuccess: (Internal) Report successful subproblems.

Description

Usage

Arguments

Value