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...

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...

In this note, we demonstrate that the problem of "many-to-one matching with (strict) preferences over colleagues" is actually more difficult than the classical many-to-one matching problem, "matching without preferences over colleagues." We give an explicit reduction of any problem of the latter...

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...

In this paper we consider a type of bias which stems from the mathematical algorithm often used to determine an optimal match between two groups. We compare two different solution concepts for the matching assignment problem: the traditionally stable solution vs. a multiplicative utility...