We study the problem of allocating workers to different projects in which each project requires having a minimum number of workers assigned to it or else it does not open. We show that the well-known serial dictatorship mechanism is neither strategy-proof nor Pareto efficient. Thus, we propose...

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.