DSpace Repository

Assessing the Performance of Matching Algorithms When Selection into Treatment Is Strong

Show simple item record

dc.creator Augurzky, Boris
dc.creator Kluve, Jochen
dc.date 2004
dc.date.accessioned 2013-10-16T07:11:10Z
dc.date.available 2013-10-16T07:11:10Z
dc.date.issued 2013-10-16
dc.identifier http://hdl.handle.net/10419/20567
dc.identifier ppn:464453011
dc.identifier.uri http://koha.mediu.edu.my:8181/xmlui/handle/10419/20567
dc.description 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.
dc.language eng
dc.publisher
dc.relation IZA Discussion paper series 1301
dc.rights http://www.econstor.eu/dspace/Nutzungsbedingungen
dc.subject C61
dc.subject C14
dc.subject ddc:330
dc.subject matching algorithms
dc.subject optimal full matching
dc.subject selection into treatment
dc.subject Mikroökonometrie
dc.subject Matching
dc.subject Bildungsertrag
dc.subject Schätzung
dc.subject Theorie
dc.subject Vereinigte Staaten
dc.title Assessing the Performance of Matching Algorithms When Selection into Treatment Is Strong
dc.type doc-type:workingPaper


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search DSpace


Advanced Search

Browse

My Account