subproblemSuccess

<code>fullmatch</code> can break up a large matching problem into smaller
subproblems (for example, using strata defined by <code>exactMatch</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."

internal

Distance based bipartite matching using minimum cost flow, oriented
to matching of treatment and control groups in observational studies ('Hansen'
and 'Klopfer' 2006 <doi:10.1198/106186006X137047>). Routines are provided to
generate distances from generalised linear models (propensity score
matching), formulas giving variables on which to limit matched distances,
stratified or exact matching directives, or calipers, alone or in
combination.

Josh Errickson

optmatch

Functions for Optimal Matching

Ben Hansen

Mark Fredrickson

Josh Buckner

Adam Rauh

subproblemSuccess function

<dl><dt>x</dt>
<dd>The result of <code>fullmatch</code> or <code>pairmatch</code>.</dd></dl>

Arguments

(Internal) Report successful subproblems. — subproblemSuccess

<dl>

<dt>x</dt>
<dd>The result of <code>fullmatch</code> or <code>pairmatch</code>.</dd>

</dl>

subproblemSuccess: (Internal) Report successful subproblems.

Description

Usage

Value

Arguments