IDEAS home Printed from https://ideas.repec.org/p/kei/dpaper/2012-018.html

Punishment-Dominance Condition on Stable Two-Sided Matching Algorithms

Author

Listed:
  • Takuya Masuzawa

    (Faculty of Economics, Keio University)

Abstract

In this article, we consider a many-to-one two-sided matching market and define a canonical strategic form game, in which any worker applies to the top k firms and is assigned to the most preferred firm that does not reject him/her. Under the substitute property of firms' preferences, the game satisfies the punishment-dominance condition. The deferred-acceptance algorithm by Gale and Shapley (Amer. Math. Monthly 69: 1962), which finds the maximum and minimum of stable matchings, is described as an instance of the algorithm by Masuzawa (Int. Jour. Game Theory 38: 2008), which determines the α-cores of the strategic form games with the punishment-dominance condition.

Suggested Citation

  • Takuya Masuzawa, 2012. "Punishment-Dominance Condition on Stable Two-Sided Matching Algorithms," Keio/Kyoto Joint Global COE Discussion Paper Series 2012-018, Keio/Kyoto Joint Global COE Program.
    • Handle: RePEc:kei:dpaper:2012-018
    as

    Download full text from publisher

    File URL: https://ies.keio.ac.jp/old_project/old/gcoe-econbus/pdf/dp/DP2012-018.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Ruud Hendrickx & Judith Timmer & Peter Borm, 2002. "A note on NTU convexity," International Journal of Game Theory, Springer;Game Theory Society, vol. 31(1), pages 29-37.
    2. Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
    3. Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
    4. Takuya Masuzawa, 2008. "Computing the cores of strategic games with punishment–dominance relations," International Journal of Game Theory, Springer;Game Theory Society, vol. 37(2), pages 185-201, June.
    5. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    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. 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.
    2. Marco LiCalzi, 2022. "Bipartite choices," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 45(2), pages 551-568, December.
    3. Jiang, Zhishan & Tian, Guoqiang, 2013. "Matching with Couples: Stability and Algorithm," MPRA Paper 57936, University Library of Munich, Germany, revised Jul 2014.
    4. Echenique, Federico & Galichon, Alfred, 2017. "Ordinal and cardinal solution concepts for two-sided matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 63-77.
    5. 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.
    6. Alvin E. Roth, 2010. "Marketplace Institutions Related to the Timing of Transactions," NBER Working Papers 16556, National Bureau of Economic Research, Inc.
    7. Odran Bonnet & Alfred Galichon & Yu-Wei Hsieh & Keith O’Hara & Matt Shum, 2022. "Yogurts Choose Consumers? Estimation of Random-Utility Models via Two-Sided Matching," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 89(6), pages 3085-3114.
    8. Echenique, Federico & Galichon, Alfred, 2017. "Ordinal and cardinal solution concepts for two-sided matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 63-77.
    9. Assaf Romm, 2014. "Implications of capacity reduction and entry in many-to-one stable matching," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(4), pages 851-875, December.
    10. 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.
    11. Alvin E. Roth, 2012. "Marketplace Institutions Related to the Timing of Transactions: Reply to Priest," Journal of Labor Economics, University of Chicago Press, vol. 30(2), pages 479-494.
    12. 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.
    13. Shashwat Khare & Souvik Roy & Ton Storcken, 2025. "Stability in Many-to-One Matching with Couples having Responsive Preferences," Papers 2507.07501, arXiv.org.
    14. 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.
    15. Noelia Juarez & Paola B. Manasero & Jorge Oviedo, 2023. "Nash implementation in a many-to-one matching market," Papers 2305.13956, arXiv.org, revised Apr 2024.
    16. Chao Huang, 2022. "Firm-worker hypergraphs," Papers 2211.06887, arXiv.org, revised Nov 2023.
    17. 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.
    18. 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.
    19. repec:aep:anales:4498 is not listed on IDEAS
    20. Atila Abdulkadiroglu & Parag A. Pathak & Alvin E. Roth & Tayfun Sönmez, 2006. "Changing the Boston School Choice Mechanism," Levine's Bibliography 122247000000001022, UCLA Department of Economics.
    21. Péter Biró & Sofya Kiselgof, 2015. "College admissions with stable score-limits," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(4), pages 727-741, December.

    More about this item

    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:kei:dpaper:2012-018. 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: Global COE Program Office (email available below). General contact details of provider: https://edirc.repec.org/data/iekeijp.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.