IDEAS home Printed from https://ideas.repec.org/p/boc/bocoec/1068.html
   My bibliography  Save this paper

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 Jul 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. 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.
    7. 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. Chien-Chung Huang & Telikepalli Kavitha, 2021. "Popularity, Mixed Matchings, and Self-Duality," Mathematics of Operations Research, INFORMS, vol. 46(2), pages 405-427, May.
    2. Imamura, Kenzo & Kawase, Yasushi, 2024. "Efficient matching under general constraints," Games and Economic Behavior, Elsevier, vol. 145(C), pages 197-207.
    3. 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.
    4. Haris Aziz & Yoichi Kasajima, 2017. "Impossibilities for probabilistic assignment," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 49(2), pages 255-275, August.
    5. Balbuzanov, Ivan, 2022. "Constrained random matching," Journal of Economic Theory, Elsevier, vol. 203(C).
    6. Han, Xiang, 2024. "A theory of fair random allocation under priorities," Theoretical Economics, Econometric Society, vol. 19(3), July.
    7. 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.
    8. Aziz, Haris & Luo, Pang & Rizkallah, Christine, 2017. "Incompatibility of efficiency and strategyproofness in the random assignment setting with indifferences," Economics Letters, Elsevier, vol. 160(C), pages 46-49.
    9. 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.
    10. Nei, Stephen & Pakzad-Hurson, Bobak, 2021. "Strategic disaggregation in matching markets," Journal of Economic Theory, Elsevier, vol. 197(C).
    11. Artemov, Georgy, 2021. "Assignment mechanisms: Common preferences and information acquisition," Journal of Economic Theory, Elsevier, vol. 198(C).
    12. 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.
    13. Yoichi Kasajima, 2013. "Probabilistic assignment of indivisible goods with single-peaked preferences," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(1), pages 203-215, June.
    14. Jiao, Zhenhua & Tian, Guoqiang & Chen, Songqing & Yang, Fei, 2016. "The blocking lemma and group incentive compatibility for matching with contracts," Mathematical Social Sciences, Elsevier, vol. 82(C), pages 65-71.
    15. Satoru Iwata & Yu Yokoi, 2020. "Finding a Stable Allocation in Polymatroid Intersection," Mathematics of Operations Research, INFORMS, vol. 45(1), pages 63-85, February.
    16. Yeon-Koo Che & Fuhito Kojima, 2010. "Asymptotic Equivalence of Probabilistic Serial and Random Priority Mechanisms," Econometrica, Econometric Society, vol. 78(5), pages 1625-1672, September.
    17. 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.
    18. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    19. Aziz, Haris & Brandl, Florian & Brandt, Felix, 2015. "Universal Pareto dominance and welfare for plausible utility functions," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 123-133.
    20. Balbuzanov, Ivan, 2020. "Short trading cycles: Paired kidney exchange with strict ordinal preferences," Mathematical Social Sciences, Elsevier, vol. 104(C), pages 78-87.

    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.