polymatching
A Matching Algorithm for Designs with Multiple Groups
Includes functions implementing the conditionally optimal matching algorithm, which can be used to generate matched samples in designs with multiple groups. The algorithm is described in Nattino, Song and Lu (2022) <doi:10.1016/j.csda.2021.107364>.
Versions across snapshots
| Version | Repository | File | Size |
|---|---|---|---|
1.0.1 |
rolling linux/jammy R-4.5 | polymatching_1.0.1.tar.gz |
69.4 KiB |
1.0.1 |
rolling linux/noble R-4.5 | polymatching_1.0.1.tar.gz |
69.3 KiB |
1.0.1 |
rolling source/ R- | polymatching_1.0.1.tar.gz |
17.8 KiB |
1.0.1 |
latest linux/jammy R-4.5 | polymatching_1.0.1.tar.gz |
69.4 KiB |
1.0.1 |
latest linux/noble R-4.5 | polymatching_1.0.1.tar.gz |
69.3 KiB |
1.0.1 |
latest source/ R- | polymatching_1.0.1.tar.gz |
17.8 KiB |
1.0.1 |
2026-04-26 source/ R- | polymatching_1.0.1.tar.gz |
17.8 KiB |
1.0.1 |
2026-04-23 source/ R- | polymatching_1.0.1.tar.gz |
17.8 KiB |
1.0.1 |
2026-04-09 windows/windows R-4.5 | polymatching_1.0.1.zip |
72.1 KiB |
1.0.1 |
2025-04-20 source/ R- | polymatching_1.0.1.tar.gz |
17.8 KiB |