MSCMT (Q27947): Difference between revisions
From MaRDI portal
Set profile property. |
Swh import (talk | contribs) SWHID from Software Heritage |
||||||||||||||
(4 intermediate revisions by 3 users not shown) | |||||||||||||||
Property / depends on software | |||||||||||||||
Property / depends on software: R / rank | |||||||||||||||
Property / depends on software: R / qualifier | |||||||||||||||
Property / depends on software | |||||||||||||||
Property / depends on software: R / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / depends on software: R / qualifier | |||||||||||||||
software version identifier: ≥ 3.2.0 | |||||||||||||||
Property / source code repository | |||||||||||||||
Property / source code repository: https://github.com/cran/MSCMT / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Software Heritage ID | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:935000d1a7119f24ffc983f9135f4a3be9dd5025 / rank | |||||||||||||||
Normal rank | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:935000d1a7119f24ffc983f9135f4a3be9dd5025 / qualifier | |||||||||||||||
Property / Software Heritage ID: swh:1:snp:935000d1a7119f24ffc983f9135f4a3be9dd5025 / qualifier | |||||||||||||||
point in time: 22 December 2023
| |||||||||||||||
links / mardi / name | links / mardi / name | ||||||||||||||
Latest revision as of 18:13, 21 March 2024
Multivariate Synthetic Control Method Using Time Series
Language | Label | Description | Also known as |
---|---|---|---|
English | MSCMT |
Multivariate Synthetic Control Method Using Time Series |
Statements
29 November 2023
0 references
Three generalizations of the synthetic control method (which has already an implementation in package 'Synth') are implemented: first, 'MSCMT' allows for using multiple outcome variables, second, time series can be supplied as economic predictors, and third, a well-defined cross-validation approach can be used. Much effort has been taken to make the implementation as stable as possible (including edge cases) without losing computational efficiency. A detailed description of the main algorithms is given in Becker and Klößner (2018) <doi:10.1016/j.ecosta.2017.08.002>.
0 references
Identifiers
22 December 2023
0 references