IDEAS home Printed from https://ideas.repec.org/a/oup/restud/v90y2023i2p948-974..html
   My bibliography  Save this article

Matching with Externalities

Author

Listed:
  • Marek Pycia
  • M Bumin Yenmez

Abstract

We incorporate externalities into the stable matching theory of two-sided markets. Extending the classical substitutes condition to markets with externalities, we establish that stable matchings exist when agent choices satisfy substitutability. We show that substitutability is a necessary condition for the existence of a stable matching in a maximal-domain sense and provide a characterization of substitutable choice functions. In addition, we extend the standard insights of matching theory, like the existence of side-optimal stable matchings and the deferred acceptance algorithm, to settings with externalities even though the standard fixed-point techniques do not apply.

Suggested Citation

  • Marek Pycia & M Bumin Yenmez, 2023. "Matching with Externalities," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 90(2), pages 948-974.
    • Handle: RePEc:oup:restud:v:90:y:2023:i:2:p:948-974.
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1093/restud/rdac032
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kimmo Eriksson & Fredrik Jansson & Thomas Vetander, 2011. "The Assignment Game With Negative Externalities And Bounded Rationality," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 13(04), pages 443-459.
    2. Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
    3. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    4. Cullen, Julie Berry & Gruber, Jonathan, 2000. "Does Unemployment Insurance Crowd Out Spousal Labor Supply?," Journal of Labor Economics, University of Chicago Press, vol. 18(3), pages 546-572, July.
    5. Jens Gudmundsson & Helga Habis, 2017. "Assignment games with externalities revisited," Economic Theory Bulletin, Springer;Society for the Advancement of Economic Theory (SAET), vol. 5(2), pages 247-257, October.
    6. Eric Budish, 2011. "The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal Incomes," Journal of Political Economy, University of Chicago Press, vol. 119(6), pages 1061-1103.
    7. Tamás Fleiner, 2003. "A Fixed-Point Approach to Stable Matchings and Some Applications," Mathematics of Operations Research, INFORMS, vol. 28(1), pages 103-126, February.
    8. Bando, Keisuke, 2014. "A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firms," Journal of Mathematical Economics, Elsevier, vol. 52(C), pages 173-181.
    Full references (including those not matched with items on IDEAS)

    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. Pycia, Marek & Yenmez, M. Bumin, 2019. "Matching with Externalities," CEPR Discussion Papers 13994, C.E.P.R. Discussion Papers.
    2. Federico Echenique & Sumit Goel & SangMok Lee, 2022. "Stable allocations in discrete exchange economies," Papers 2202.04706, arXiv.org, revised Feb 2024.
    3. 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.
    4. Bo Chen, 2019. "Downstream competition and upstream labor market matching," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(4), pages 1055-1085, December.
    5. Bando, Keisuke, 2014. "A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firms," Journal of Mathematical Economics, Elsevier, vol. 52(C), pages 173-181.
    6. Paula Jaramillo & Çaǧatay Kayı & Flip Klijn, 2014. "On the exhaustiveness of truncation and dropping strategies in many-to-many matching markets," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 42(4), pages 793-811, April.
    7. Scott Duke Kominers & Alexander Teytelboym & Vincent P Crawford, 2017. "An invitation to market design," Oxford Review of Economic Policy, Oxford University Press and Oxford Review of Economic Policy Limited, vol. 33(4), pages 541-571.
    8. Chen, Peter & Egesdal, Michael & Pycia, Marek & Yenmez, M. Bumin, 2016. "Median stable matchings in two-sided markets," Games and Economic Behavior, Elsevier, vol. 97(C), pages 64-69.
    9. Chao Huang, 2021. "Stable matching: an integer programming approach," Papers 2103.03418, arXiv.org, revised Apr 2022.
    10. Hatfield, John William & Kojima, Fuhito, 2010. "Substitutes and stability for matching with contracts," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1704-1723, September.
    11. Aslan, Fatma & Lainé, Jean, 2020. "Competitive equilibria in Shapley–Scarf markets with couples," Journal of Mathematical Economics, Elsevier, vol. 89(C), pages 66-78.
    12. Federico Echenique & Ruy González & Alistair J. Wilson & Leeat Yariv, 2022. "Top of the Batch: Interviews and the Match," American Economic Review: Insights, American Economic Association, vol. 4(2), pages 223-238, June.
    13. Dur, Umut Mert & Wiseman, Thomas, 2019. "School choice with neighbors," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 101-109.
    14. Kojima, Fuhito, 2013. "Efficient resource allocation under multi-unit demand," Games and Economic Behavior, Elsevier, vol. 82(C), pages 1-14.
    15. Fisher, James C.D. & Hafalir, Isa E., 2016. "Matching with aggregate externalities," Mathematical Social Sciences, Elsevier, vol. 81(C), pages 1-7.
    16. Antonio Romero-Medina & Matteo Triossi, 2018. "Centralized Course Allocation," Documentos de Trabajo 340, Centro de Economía Aplicada, Universidad de Chile.
    17. Thanh Nguyen & Rakesh Vohra, 2014. "Near Feasible Stable Matchings with Complementarities," PIER Working Paper Archive 14-028, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    18. Agustin G. Bonifacio & Nadia Guiñazú & Noelia Juarez & Pablo Neme & Jorge Oviedo, 2024. "The lattice of envy-free many-to-many matchings with contracts," Theory and Decision, Springer, vol. 96(1), pages 113-134, February.
    19. Echenique, Federico & Yenmez, M. Bumin, 2007. "A solution to matching with preferences over colleagues," Games and Economic Behavior, Elsevier, vol. 59(1), pages 46-71, April.
    20. Tamás Fleiner & Ravi Jagadeesan & Zsuzsanna Jankó & Alexander Teytelboym, 2019. "Trading Networks With Frictions," Econometrica, Econometric Society, vol. 87(5), pages 1633-1661, September.

    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:oup:restud:v:90:y:2023:i:2:p:948-974.. 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: Oxford University Press (email available below). General contact details of provider: https://academic.oup.com/restud .

    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.