IDEAS home Printed from https://ideas.repec.org/p/mtl/montde/2016-08.html
   My bibliography  Save this paper

Assigning refugees to landlords in Sweden: stable maximum matchings

Author

Listed:
  • ANDERSSON, Tommy
  • EHLERS, Lars

Abstract

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.

Suggested Citation

  • ANDERSSON, Tommy & EHLERS, Lars, 2016. "Assigning refugees to landlords in Sweden: stable maximum matchings," Cahiers de recherche 2016-08, Universite de Montreal, Departement de sciences economiques.
  • Handle: RePEc:mtl:montde:2016-08
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/1866/16359
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Eric Budish & Estelle Cantillon, 2012. "The Multi-unit Assignment Problem: Theory and Evidence from Course Allocation at Harvard," American Economic Review, American Economic Association, vol. 102(5), pages 2237-2271, August.
    2. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, Oxford University Press, vol. 119(2), pages 457-488.
    3. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-proofness versus Efficiency in Matching with Indifferences: Redesigning the New York City High School Match," NBER Working Papers 14864, National Bureau of Economic Research, Inc.
    4. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    5. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    6. Aytek Erdil & Haluk Ergin, 2008. "What's the Matter with Tie-Breaking? Improving Efficiency in School Choice," American Economic Review, American Economic Association, vol. 98(3), pages 669-689, June.
    7. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    8. Tayfun Sönmez, 2013. "Bidding for Army Career Specialties: Improving the ROTC Branching Mechanism," Journal of Political Economy, University of Chicago Press, vol. 121(1), pages 186-219.
    9. Salvador Barberà & Dolors Berga & Bernardo Moreno, 2016. "Group Strategy-Proofness in Private Good Economies," American Economic Review, American Economic Association, vol. 106(4), pages 1073-1099, April.
    10. Atila Abdulkadiroglu & Tayfun Sönmez, 2003. "School Choice: A Mechanism Design Approach," American Economic Review, American Economic Association, vol. 93(3), pages 729-747, June.
    11. Tayfun Sönmez & Tobias B. Switzer, 2013. "Matching With (Branch‐of‐Choice) Contracts at the United States Military Academy," Econometrica, Econometric Society, vol. 81(2), pages 451-488, March.
    12. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth, 2009. "Strategy-Proofness versus Efficiency in Matching with Indifferences: Redesigning the NYC High School Match," American Economic Review, American Economic Association, vol. 99(5), pages 1954-1978, December.
    13. Tayfun Sönmez & M. Utku Ünver, 2009. "Matching, Allocation, and Exchange of Discrete Resources," Boston College Working Papers in Economics 717, Boston College Department of Economics.
    14. Balinski, Michel & Sonmez, Tayfun, 1999. "A Tale of Two Mechanisms: Student Placement," Journal of Economic Theory, Elsevier, vol. 84(1), pages 73-94, January.
    15. Elliott Peranson & Alvin E. Roth, 1999. "The Redesign of the Matching Market for American Physicians: Some Engineering Aspects of Economic Design," American Economic Review, American Economic Association, vol. 89(4), pages 748-780, September.
    16. Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press, vol. 33(4), pages 541-571.
    2. Guillaume Haeringer & Vincent Iehlé, 2019. "Two-Sided Matching with (Almost) One-Sided Preferences," American Economic Journal: Microeconomics, American Economic Association, vol. 11(3), pages 155-190, August.
    3. Anastasia Blouchoutzi & Dimitra Manou & Jason Papathanasiou, 2022. "The Regional Allocation of Asylum Seekers in Greece: A Multiple Criteria Decision Analysis Approach," Sustainability, MDPI, vol. 14(10), pages 1-15, May.
    4. ANDERSSON, Tommy & EHLERS, Lars & MARTINELLO, Alessandro, 2018. "Dynamic refugee matching," Cahiers de recherche 2018-16, Universite de Montreal, Departement de sciences economiques.
    5. Tommy Andersson & Lars Ehlers, 2020. "Assigning Refugees to Landlords in Sweden: Efficient, Stable, and Maximum Matchings," Scandinavian Journal of Economics, Wiley Blackwell, vol. 122(3), pages 937-965, July.
    6. Zhang, Jun, 2019. "Efficient and fair assignment mechanisms are strongly group manipulable," Journal of Economic Theory, Elsevier, vol. 180(C), pages 167-177.
    7. Andersson, Tommy, 2017. "Refugee Matching as a Market Design Application," Working Papers 2017:16, Lund University, Department of Economics.
    8. Guillaume Haeringer & Vincent Iehlé, 2019. "Two-Sided Matching with (Almost) One-Sided Preferences," American Economic Journal: Microeconomics, American Economic Association, vol. 11(3), pages 155-190, August.
    9. Avidit Acharya & Kirk Bansak & Jens Hainmueller, 2019. "Combining Outcome-Based and Preference-Based Matching: A Constrained Priority Mechanism," Papers 1902.07355, arXiv.org, revised Aug 2020.
    10. Haris Aziz & Florian Brandl, 2021. "Efficient, Fair, and Incentive-Compatible Healthcare Rationing," Papers 2102.04384, arXiv.org, revised Sep 2021.
    11. Noda, Shunya, 2020. "Size versus truncation robustness in the assignment problem," Journal of Mathematical Economics, Elsevier, vol. 87(C), pages 1-5.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Andersson, Tommy & Ehlers, Lars, 2016. "Assigning Refugees to Landlords in Sweden: Efficient Stable Maximum Matchings," Working Papers 2016:18, Lund University, Department of Economics, revised 27 Aug 2018.
    2. Kyle Greenberg & Parag A. Pathak & Tayfun Sönmez, 2020. "Mechanism Design meets Priority Design: Redesigning the US Army’s Branching Process Through Market Design," Boston College Working Papers in Economics 1035, Boston College Department of Economics.
    3. Kyle Greenberg & Parag A. Pathak & Tayfun Sonmez, 2021. "Mechanism Design meets Priority Design: Redesigning the US Army's Branching Process," Papers 2106.06582, arXiv.org.
    4. Hatfield, John William & Kojima, Fuhito & Narita, Yusuke, 2016. "Improving schools through school choice: A market design approach," Journal of Economic Theory, Elsevier, vol. 166(C), pages 186-211.
    5. Tommy Andersson & Lars Ehlers, 2020. "Assigning Refugees to Landlords in Sweden: Efficient, Stable, and Maximum Matchings," Scandinavian Journal of Economics, Wiley Blackwell, vol. 122(3), pages 937-965, July.
    6. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    7. Lars Ehlers & Bettina Klaus, 2012. "Strategy-Proofness Makes the Difference : Deferred-Acceptance with Responsive Priorities," Cahiers de recherche 15-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    8. Kesten, Onur & Kurino, Morimitsu, 2019. "Strategy-proof improvements upon deferred acceptance: A maximal domain for possibility," Games and Economic Behavior, Elsevier, vol. 117(C), pages 120-143.
    9. Anno, Hidekazu & Kurino, Morimitsu, 2016. "On the operation of multiple matching markets," Games and Economic Behavior, Elsevier, vol. 100(C), pages 166-185.
    10. Lars Ehlers & Bettina Klaus, 2014. "Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities," Mathematics of Operations Research, INFORMS, vol. 39(4), pages 949-966, November.
    11. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press, vol. 33(4), pages 541-571.
    12. Diebold, Franz & Bichler, Martin, 2017. "Matching with indifferences: A comparison of algorithms in the context of course allocation," European Journal of Operational Research, Elsevier, vol. 260(1), pages 268-282.
    13. Alvin Roth, 2008. "Deferred acceptance algorithms: history, theory, practice, and open questions," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 537-569, March.
    14. José Alcalde & Antonio Romero-Medina, 2017. "Fair student placement," Theory and Decision, Springer, vol. 83(2), pages 293-307, August.
    15. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.
    16. Troyan, Peter & Morrill, Thayer, 2020. "Obvious manipulations," Journal of Economic Theory, Elsevier, vol. 185(C).
    17. Alcalde, José & Romero-Medina, Antonio, 2011. "Fair School Placement," QM&ET Working Papers 11-1, University of Alicante, D. Quantitative Methods and Economic Theory.
    18. Bettina Klaus & David F. Manlove & Francesca Rossi, 2014. "Matching under Preferences," Cahiers de Recherches Economiques du Département d'économie 14.07, Université de Lausanne, Faculté des HEC, Département d’économie.
    19. Umut M. Dur & Scott Duke Kominers & Parag A. Pathak & Tayfun Sönmez, 2013. "The Demise of Walk Zones in Boston: Priorities vs. Precedence in School Choice," NBER Working Papers 18981, National Bureau of Economic Research, Inc.
    20. Alvin E. Roth, 2009. "What Have We Learned from Market Design?," Innovation Policy and the Economy, University of Chicago Press, vol. 9(1), pages 79-112.

    More about this item

    Keywords

    Refugees; private landlords; forced migration; market design; stable maximum matchings;
    All these keywords.

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation
    • F22 - International Economics - - International Factor Movements and International Business - - - International Migration

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mtl:montde:2016-08. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sharon BREWER (email available below). General contact details of provider: https://edirc.repec.org/data/demtlca.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.