Assigning Refugees to Landlords in Sweden: Stable Maximum Matchings

The member states of the European Union received 1.2 million first time asylum applications in 2015 (a doubling compared to 2014). Even if asylum will be granted for many of the refugees that made the journey to Europe, several obstacles for successful integration remain. This paper focuses on one of these obstacles, namely the problem of finding housing for refugees once they have been granted asylum. In particular, the focus is restricted to the situation in Sweden during 2015–2016 and it is demonstrated that market design can play an important role in a partial solution to the problem. More specifically, because almost all accommodation options are exhausted in Sweden, the paper investigates a matching system, closely related to the system adopted by the European NGO “Refugees Welcome”, and proposes an easy-to-implement algorithm that finds a stable maximum matching. Such matching guarantees that housing is provided to a maximum number of refugees and that no refugee prefers some landlord to their current match when, at the same time, that specific landlord prefers that refugee to his current match.

Von Neumann-Morgenstern Stable Sets in Matching Problems

The following properties of the core of a one well-known: (i) the core is non-empty; (ii) the core is a lattice; and (iii) the set of unmatched agents is identical for any two matchings belonging to the core. The literature on two-sided matching focuses almost exclusively on the core and studies extensively its properties. Our main result is the following characterization of (von Neumann-Morgenstern) stable sets in one-to-one matching problem only if it is a maximal set satisfying the following properties : (a) the core is a subset of the set; (b) the set is a lattice; (c) the set of unmatched agents is identical for any two matchings belonging to the set. Furthermore, a set is a stable set if it is the unique maximal set satisfying properties (a), (b) and (c). We also show that our main result does not extend from one-to-one matching problems to many-to-one matching problems.