IDEAS home Printed from https://ideas.repec.org/a/eee/mateco/v83y2019icp63-69.html
   My bibliography  Save this article

On the number of employed in the matching model

Author

Listed:
  • Kitahara, Minoru
  • Okumura, Yasunori

Abstract

This study analyzes the number of matches in stable and efficient matchings. The benchmark number of matches is the largest one among the matchings in which no agent can be better off by itself. We show that, in the one-to-one matching model, the number of matches in any stable matching is more than or equal to the smallest integer that is not less than half of the benchmark number. This result is satisfied even if “stable matching” is replaced by “efficient matching”. We extend the model to the many-to-one matching one and provide the sets of preference profiles in which each of the above results continues to hold.

Suggested Citation

  • Kitahara, Minoru & Okumura, Yasunori, 2019. "On the number of employed in the matching model," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 63-69.
    • Handle: RePEc:eee:mateco:v:83:y:2019:i:c:p:63-69
    DOI: 10.1016/j.jmateco.2019.04.004
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S030440681930045X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2019.04.004?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Atila Abdulkadiroğlu & Parag A. Pathak & Alvin E. Roth, 2005. "The New York City High School Match," American Economic Review, American Economic Association, vol. 95(2), pages 364-367, May.
    2. Klaus, Bettina & Walzl, Markus, 2009. "Stable many-to-many matchings with contracts," Journal of Mathematical Economics, Elsevier, vol. 45(7-8), pages 422-434, July.
    3. Bogomolnaia, Anna & Moulin, Herve, 2015. "Size versus fairness in the assignment problem," Games and Economic Behavior, Elsevier, vol. 90(C), pages 119-127.
    4. Konishi, Hideo & Unver, M. Utku, 2006. "Credible group stability in many-to-many matching problems," Journal of Economic Theory, Elsevier, vol. 129(1), pages 57-80, July.
    5. Fuhito Kojima & Parag A. Pathak, 2009. "Incentives and Stability in Large Two-Sided Matching Markets," American Economic Review, American Economic Association, vol. 99(3), pages 608-627, June.
    6. Ruth Martínez & Jordi Massó & Alejdanro Neme & Jorge Oviedo, 2004. "On group strategy-proof mechanisms for a many-to-one matching model," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(1), pages 115-128, January.
    7. Martínez, Ruth & Massó, Jordi & Neme, Alejandro & Oviedo, Jorge, 2010. "The Blocking Lemma for a many-to-one matching model," Journal of Mathematical Economics, Elsevier, vol. 46(5), pages 937-949, September.
    8. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    9. Okumura, Yasunori, 2017. "A one-sided many-to-many matching problem," Journal of Mathematical Economics, Elsevier, vol. 72(C), pages 104-111.
    10. Lance Lochner & Enrico Moretti, 2004. "The Effect of Education on Crime: Evidence from Prison Inmates, Arrests, and Self-Reports," American Economic Review, American Economic Association, vol. 94(1), pages 155-189, March.
    11. John William Hatfield & Scott Duke Kominers & Alexander Westkamp, 2017. "Stable and Strategy-Proof Matching with Flexible Allotments," American Economic Review, American Economic Association, vol. 107(5), pages 214-219, May.
    12. Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
    13. Yasunori Okumura, 2019. "School Choice with General Constraints: A Market Design Approach for the Nursery School Waiting List Problem in Japan," The Japanese Economic Review, Springer, vol. 70(4), pages 497-516, December.
    14. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    15. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    16. Heckman, James J., 2013. "Giving Kids a Fair Chance," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262019132, December.
    17. Yuichiro Kamada & Fuhito Kojima, 2015. "Efficient Matching under Distributional Constraints: Theory and Applications," American Economic Review, American Economic Association, vol. 105(1), pages 67-99, January.
    18. 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.
    19. Hatfield, John William & Kojima, Fuhito, 2009. "Group incentive compatibility for matching with contracts," Games and Economic Behavior, Elsevier, vol. 67(2), pages 745-749, November.
    20. Martinez, Ruth & Masso, Jordi & Neme, Alejandro & Oviedo, Jorge, 2000. "Single Agents and the Set of Many-to-One Stable Matchings," Journal of Economic Theory, Elsevier, vol. 91(1), pages 91-105, March.
    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. Yasunori Okumura, 2019. "School Choice with General Constraints: A Market Design Approach for the Nursery School Waiting List Problem in Japan," The Japanese Economic Review, Japanese Economic Association, vol. 70(4), pages 497-516, December.
    2. Fisher, James C.D., 2020. "Existence of stable allocations in matching markets with infinite contracts: A topological approach," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 136-140.
    3. Minoru Kitahara & Yasunori Okumura, 2021. "Improving efficiency in school choice under partial priorities," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(4), pages 971-987, December.
    4. Wang, Zhihong & Li, Yangyang & Gu, Fu & Guo, Jianfeng & Wu, Xiaojun, 2020. "Two-sided matching and strategic selection on freight resource sharing platforms," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 559(C).
    5. Yoichi Kasajima & Manabu Toda, 2021. "Singles monotonicity and stability in one-to-one matching problems," Working Papers 2023-1, Waseda University, Faculty of Political Science and Economics.

    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. 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.
    2. Jiao, Zhenhua & Tian, Guoqiang, 2017. "The Blocking Lemma and strategy-proofness in many-to-many matchings," Games and Economic Behavior, Elsevier, vol. 102(C), pages 44-55.
    3. Jagadeesan, Ravi, 2018. "Lone wolves in infinite, discrete matching markets," Games and Economic Behavior, Elsevier, vol. 108(C), pages 275-286.
    4. Klijn, Flip & Yazıcı, Ayşe, 2014. "A many-to-many ‘rural hospital theorem’," Journal of Mathematical Economics, Elsevier, vol. 54(C), pages 63-73.
    5. Hatfield, John William & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    6. Tamás Fleiner & Ravi Jagadeesan & Zsuzsanna Jankó & Alexander Teytelboym, 2019. "Trading Networks With Frictions," Econometrica, Econometric Society, vol. 87(5), pages 1633-1661, September.
    7. Yenmez, M. Bumin, 2018. "A college admissions clearinghouse," Journal of Economic Theory, Elsevier, vol. 176(C), pages 859-885.
    8. Ehlers, Lars & Hafalir, Isa E. & Yenmez, M. Bumin & Yildirim, Muhammed A., 2014. "School choice with controlled choice constraints: Hard bounds versus soft bounds," Journal of Economic Theory, Elsevier, vol. 153(C), pages 648-683.
    9. 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.
    10. Dimakopoulos, Philipp D. & Heller, C.-Philipp, 2019. "Matching with waiting times: The German entry-level labor market for lawyers," Games and Economic Behavior, Elsevier, vol. 115(C), pages 289-313.
    11. Hatfield, John William & Kominers, Scott Duke, 2015. "Multilateral matching," Journal of Economic Theory, Elsevier, vol. 156(C), pages 175-206.
    12. Jagadeesan, Ravi & Kominers, Scott Duke & Rheingans-Yoo, Ross, 2018. "Strategy-proofness of worker-optimal matching with continuously transferable utility," Games and Economic Behavior, Elsevier, vol. 108(C), pages 287-294.
    13. 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.
    14. Eliana Pepa Risma, 2022. "Matching with contracts: calculation of the complete set of stable allocations," Theory and Decision, Springer, vol. 93(3), pages 449-461, October.
    15. Bando, Keisuke & Hirai, Toshiyuki, 2021. "Stability and venture structures in multilateral matching," Journal of Economic Theory, Elsevier, vol. 196(C).
    16. Antonio Romero-Medina & Matteo Triossi, 2023. "Take-it-or-leave-it contracts in many-to-many matching markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 75(2), pages 591-623, February.
    17. Hafalir, Isa E. & Kojima, Fuhito & Yenmez, M. Bumin, 2022. "Interdistrict school choice: A theory of student assignment," Journal of Economic Theory, Elsevier, vol. 201(C).
    18. Fisher, James C.D., 2020. "Existence of stable allocations in matching markets with infinite contracts: A topological approach," Journal of Mathematical Economics, Elsevier, vol. 91(C), pages 136-140.
    19. Klaus, Bettina & Walzl, Markus, 2009. "Stable many-to-many matchings with contracts," Journal of Mathematical Economics, Elsevier, vol. 45(7-8), pages 422-434, July.
    20. Kasuya, Yusuke, 2021. "Group incentive compatibility and welfare for matching with contracts," Economics Letters, Elsevier, vol. 202(C).

    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:eee:mateco:v:83:y:2019:i:c:p:63-69. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/jmateco .

    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.