<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>Approximately Optimal Fine Balance Matching with Multiple Groups</dc:title>
  <dc:title>R package approxmatch version 2.0</dc:title>
  <dc:subject>CRAN Task View: CausalInference (https://CRAN.R-project.org/view=CausalInference)</dc:subject>
  <dc:description>Tools for constructing a matched design with multiple comparison groups.
 Further specifications of refined covariate balance restriction and exact match on 
 covariate can be imposed. Matches are approximately optimal in  the sense that the 
 cost of the solution is at most twice the optimal cost, Crama and Spieksma (1992) 
 &lt;doi:10.1016/0377-2217(92)90078-N&gt;, Karmakar, Small and Rosenbaum (2019)
 &lt;doi:10.1080/10618600.2019.1584900&gt;.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Suggests: optmatch, MASS</dc:relation>
  <dc:creator>Bikram Karmakar &lt;bkarmakar@ufl.edu&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Bikram Karmakar</dc:contributor>
  <dc:rights>MIT + file LICENSE (https://CRAN.R-project.org/package=approxmatch/LICENSE)</dc:rights>
  <dc:date>2020-03-30</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=approxmatch</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.approxmatch</dc:identifier>
</oai_dc:dc>
