addBalance

Matching algorithm based on network-flow structure.
Users are able to modify the emphasis on three different
optimization goals: two different distance measures and
the number of treated units left unmatched. The method is proposed by Pimentel
and Kelz (2019) <doi:10.1080/01621459.2020.1720693>.
The 'rrelaxiv' package, which provides an alternative solver for
the underlying network flow problems, carries an
academic license and is not available on CRAN, but
may be downloaded from Github at
<https://github.com/josherrickson/rrelaxiv/>.

Shichao Han

MultiObjMatch

Multi-Objective Matching Algorithm

Samuel D. Pimentel

addBalance function

<dl><dt>net</dt>
<dd>the network object created for the network flow problem</dd>
<dt>treatedVals</dt>
<dd>the balance value for treated nodes</dd>
<dt>controlVals</dt>
<dd>the balance value for control nodes</dd>
<dt>replaceExisting</dt>
<dd>(optional) whether or not to replace the existing net;
TRUE by default</dd></dl>

Arguments

Add fine balance edges — addBalance

<dl>

<dt>net</dt>
<dd>the network object created for the network flow problem</dd>


<dt>treatedVals</dt>
<dd>the balance value for treated nodes</dd>


<dt>controlVals</dt>
<dd>the balance value for control nodes</dd>


<dt>replaceExisting</dt>
<dd>(optional) whether or not to replace the existing net;
TRUE by default</dd>

</dl>

addBalance: Add fine balance edges

Description

Usage

Value

Arguments