The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
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) <doi:10.1016/0377-2217(92)90078-N>, Karmakar, Small and Rosenbaum (2019) <doi:10.1080/10618600.2019.1584900>.
| Version: | 2.0 |
| Suggests: | optmatch, MASS |
| Published: | 2020-03-30 |
| DOI: | 10.32614/CRAN.package.approxmatch |
| Author: | Bikram Karmakar |
| Maintainer: | Bikram Karmakar <bkarmakar at ufl.edu> |
| License: | MIT + file LICENSE |
| NeedsCompilation: | no |
| In views: | CausalInference |
| CRAN checks: | approxmatch results |
| Reference manual: | approxmatch.pdf |
| Package source: | approxmatch_2.0.tar.gz |
| Windows binaries: | r-devel: approxmatch_2.0.zip, r-release: approxmatch_2.0.zip, r-oldrel: approxmatch_2.0.zip |
| macOS binaries: | r-release (arm64): approxmatch_2.0.tgz, r-oldrel (arm64): approxmatch_2.0.tgz, r-release (x86_64): approxmatch_2.0.tgz, r-oldrel (x86_64): approxmatch_2.0.tgz |
| Old sources: | approxmatch archive |
Please use the canonical form https://CRAN.R-project.org/package=approxmatch to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.