InfinitySparseMatrix-class

<p><code>InfinitySparseMatrix</code> is a special class of distance specifications. Finite entries
indicate possible matches, while infinite entries indicated non-allowed
matches. This data type can be more space efficient for sparse matching
problems.</p>

Distance based bipartite matching using the RELAX-IV minimum cost flow solver,
oriented to matching of treatment and control groups in observational
studies. 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.

Mark Fredrickson

InfinitySparseMatrix-class: Objects for sparse matching problems.

Description

Arguments

Details

See Also