EconStor >
Halle Institute for Economic Research (IWH) – Member of the Leibniz Association >
IWH Discussion Papers, Halle Institute for Economic Research (IWH) >

Please use this identifier to cite or link to this item:
Title:Evaluation of Further Training Programmes with an Optimal Matching Algorithm PDF Logo
Authors:Wiemers, Jürgen
Schultz, Birgit
Reinowski, Eva
Issue Date:2004
Series/Report no.:Diskussionspapiere / Institut für Wirtschaftsforschung Halle 188
Abstract:This paper evaluates the effects of further training on the individual unemployment duration of different groups of persons representing individual characteristics and some aspects of the economic environment. The Micro Census Saxony enables us to include additional information about a person?s employment history to eliminate the bias resulting from unobservable characteristics and to avoid Ashenfelter?s Dip. To solve the sample selection problem we employ an optimal full matching assignment, the Hungarian algorithm, using an aggregate distance measure. This procedure is superior to greedy pair matching in the sense that it avoids the loss of observations due to the design of the algorithm and yields the optimal assignment result, i.e. the minimum total sum of squared distances. The impact of participation in further training is evaluated by comparing the unemployment duration between participants and non-participants using the Cox Proportional Hazard Model. Overall, we find empirical evidence that participation in further training programmes results in even longer unemployment duration - with only gradual differences in the analysed groups.
Persistent Identifier of the first edition:urn:nbn:de:gbv:3:2-3039
Document Type:Working Paper
Appears in Collections:IWH Discussion Papers, Halle Institute for Economic Research (IWH)
Publikationen von Forscherinnen und Forschern des IWH

Files in This Item:
File Description SizeFormat
188.pdf282.68 kBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:

Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.