Two-Sided Matching with Partial Participation

Abstract: We introduce the concept of safe partial matchings to address the problem of two-sided matching with partial participation. Safety provides a strong guarantee that assigned agents will not be part of blocking coalitions. We prove existence, study the structure of the set of safe matchings, derive comparative statics with respect to participation and entry, and show how to compute maximal safe matchings.