Dettmann, Eva; Schultz, Birgit; Wiemers, Jürgen - 2004 - This version: December 2004
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 … the sample selection
problem we employ an optimal full matching assignment, the Hungarian algorithm, using an
aggregate …