Assessing the performance of matching algorithms when selection into treatment is strong
✍ Scribed by Boris Augurzky; Jochen Kluve
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 190 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0883-7252
- DOI
- 10.1002/jae.919
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
This paper investigates the method of matching regarding two crucial implementation choices: the distance measure and the type of algorithm. We implement optimal full matching—a fully efficient algorithm—and present a framework for statistical inference. The implementation uses data from the NLSY79 to study the effect of college education on earnings. We find that decisions regarding the matching algorithm depend on the structure of the data: In the case of strong selection into treatment and treatment effect heterogeneity a full matching seems preferable. If heterogeneity is weak, pair matching suffices. Copyright © 2007 John Wiley & Sons, Ltd.