IDEAS home Printed from https://ideas.repec.org/p/boc/bocoec/1068.html

Matching under Non-transferable Utility: Theory

Author

Listed:
  • Tayfun Sönmez

    (Boston College)

  • M. Utku Ünver

    (Boston College)

Abstract

We survey the literature on matching theory under non-transferable utility using a classification based on property rights (i) with private ownership, (ii) with common and mixed ownership, and (iii) under priority-based entitlements.

Suggested Citation

  • Tayfun Sönmez & M. Utku Ünver, 2024. "Matching under Non-transferable Utility: Theory," Boston College Working Papers in Economics 1068, Boston College Department of Economics, revised 01 Oct 2025.
  • Handle: RePEc:boc:bocoec:1068
    as

    Download full text from publisher

    File URL: http://fmwww.bc.edu/EC-P/wp1068.pdf
    File Function: main text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. 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.
    2. Heo, Eun Jeong & Yılmaz, Özgür, 2015. "A characterization of the extended serial correspondence," Journal of Mathematical Economics, Elsevier, vol. 59(C), pages 102-110.
    3. Carroll, Gabriel, 2014. "A general equivalence theorem for allocation of indivisible objects," Journal of Mathematical Economics, Elsevier, vol. 51(C), pages 163-177.
    4. Klaus, Bettina, 2008. "The coordinate-wise core for multiple-type housing markets is second-best incentive compatible," Journal of Mathematical Economics, Elsevier, vol. 44(9-10), pages 919-924, September.
    5. ,, 2015. "Serial dictatorship: the unique optimal allocation rule when information is endogenous," Theoretical Economics, Econometric Society, vol. 10(2), May.
    6. Charles Blair, 1988. "The Lattice Structure of the Set of Stable Matchings with Multiple Partners," Mathematics of Operations Research, INFORMS, vol. 13(4), pages 619-628, November.
    7. Jens Gudmundsson, 2014. "When do stable roommate matchings exist? A review," Review of Economic Design, Springer;Society for Economic Design, vol. 18(2), pages 151-161, June.
    8. Katta, Akshay-Kumar & Sethuraman, Jay, 2006. "A solution to the random assignment problem on the full preference domain," Journal of Economic Theory, Elsevier, vol. 131(1), pages 231-250, November.
    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. 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.
    2. Danilov, Vladimir I. & Karzanov, Alexander V., 2023. "Stable and meta-stable contract networks," Journal of Mathematical Economics, Elsevier, vol. 108(C).
    3. 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.
    4. Jan Christoph Schlegel, 2016. "Virtual Demand and Stable Mechanisms," Cahiers de Recherches Economiques du Département d'économie 16.11, Université de Lausanne, Faculté des HEC, Département d’économie.
    5. 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.
    6. Imamura, Kenzo & Kawase, Yasushi, 2024. "Efficient matching under general constraints," Games and Economic Behavior, Elsevier, vol. 145(C), pages 197-207.
    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. Sophie Bade, 2016. "Pareto-optimal matching allocation mechanisms for boundedly rational agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 501-510, October.
    9. Bando, Keisuke & Kawasaki, Ryo, 2024. "Stability and substitutability in multi-period matching markets," Games and Economic Behavior, Elsevier, vol. 147(C), pages 533-553.
    10. Vladimir I. Danilov, 2024. "Sequential choice functions and stability problems," Papers 2401.00748, arXiv.org, revised Mar 2024.
    11. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    12. Yu-Ting Ho, 2025. "Matching Under Preference Uncertainty: Random Allocation, Informativeness, and Welfare," Papers 2511.09988, arXiv.org.
    13. Mustafa Oǧuz Afacan, 2016. "Characterizations of the cumulative offer process," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 531-542, October.
    14. Jan Christoph Schlegel, 2014. "Contracts versus Salaries in Matching: A General Result. N.B.: This paper replaces Nr 13.09 "Contracts versus Salaries in Matching: Comment", (June 2013)," Cahiers de Recherches Economiques du Département d'économie 14.05, Université de Lausanne, Faculté des HEC, Département d’économie.
    15. Federico Echenique & Teddy Mekonnen & M. Bumin Yenmez, 2026. "Distributional Preferences for Market Design," Papers 2602.08035, arXiv.org.
    16. 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.
    17. Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
    18. repec:aep:anales:4498 is not listed on IDEAS
    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. Kamada, Yuichiro & Kojima, Fuhito, 2018. "Stability and strategy-proofness for matching with constraints: a necessary and sufficient condition," Theoretical Economics, Econometric Society, vol. 13(2), May.
    21. Danilov, V., 2021. "Stable systems of schedule contracts," Journal of the New Economic Association, New Economic Association, vol. 51(3), pages 12-29.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D47 - Microeconomics - - Market Structure, Pricing, and Design - - - Market Design

    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:boc:bocoec:1068. 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: Christopher F Baum (email available below). General contact details of provider: https://edirc.repec.org/data/debocus.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.