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

A one-sided many-to-many matching problem

Author

Listed:
  • Okumura, Yasunori

Abstract

This study discusses a one-sided many-to-many matching model wherein agents may not be divided into two disjoint sets. Moreover, each agent is allowed to have multiple partnerships in our model. We restrict our attention to the case where the preference of each agent is single-peaked over: (i) the total number of partnerships with all other agents, and (ii) the number of partnerships that the agent has with each of the other agents. We represent a matching as a multigraph, and characterize a matching that is stable and constrained efficient. Finally, we show that any direct mechanism for selecting a stable and constrained efficient matching is not strategy-proof.

Suggested Citation

  • Okumura, Yasunori, 2017. "A one-sided many-to-many matching problem," Journal of Mathematical Economics, Elsevier, vol. 72(C), pages 104-111.
    • Handle: RePEc:eee:mateco:v:72:y:2017:i:c:p:104-111
    DOI: 10.1016/j.jmateco.2017.07.006
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0304406816302865
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.jmateco.2017.07.006?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. Chung, Kim-Sau, 2000. "On the Existence of Stable Roommate Matchings," Games and Economic Behavior, Elsevier, vol. 33(2), pages 206-230, November.
    2. Jackson, Matthew O. & van den Nouweland, Anne, 2005. "Strongly stable networks," Games and Economic Behavior, Elsevier, vol. 51(2), pages 420-444, May.
    3. 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.
    4. John William Hatfield & Scott Duke Kominers, 2012. "Matching in Networks with Bilateral Contracts," American Economic Journal: Microeconomics, American Economic Association, vol. 4(1), pages 176-208, February.
    5. Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
    6. Alvin E. Roth, 1985. "Conflict and Coincidence of Interest in Job Matching: Some New Results and Open Questions," Mathematics of Operations Research, INFORMS, vol. 10(3), pages 379-389, August.
    7. Tayfun Sönmez & Suryapratim Banerjee & Hideo Konishi, 2001. "Core in a simple coalition formation game," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 18(1), pages 135-153.
    8. Sönmez, Tayfun & Ünver, M. Utku, 2014. "Altruistically unbalanced kidney exchange," Journal of Economic Theory, Elsevier, vol. 152(C), pages 105-129.
    9. Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
    10. Sanjeev Goyal & Sumit Joshi, 2006. "Unequal connections," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(3), pages 319-349, October.
    11. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    12. YIlmaz, Özgür, 2011. "Kidney exchange: An egalitarian mechanism," Journal of Economic Theory, Elsevier, vol. 146(2), pages 592-618, March.
    13. Alvin E. Roth, 2002. "The Economist as Engineer: Game Theory, Experimentation, and Computation as Tools for Design Economics," Econometrica, Econometric Society, vol. 70(4), pages 1341-1378, July.
    14. Paul Belleflamme & Francis Bloch, 2004. "Market sharing agreements and collusive networks," International Economic Review, Department of Economics, University of Pennsylvania and Osaka University Institute of Social and Economic Research Association, vol. 45(2), pages 387-411, May.
    15. Fuhito Kojima & M. Ünver, 2008. "Random paths to pairwise stability in many-to-many matching problems: a study on market equilibration," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 473-488, March.
    16. John William Hatfield & Scott Duke Kominers & Alexandru Nichifor & Michael Ostrovsky & Alexander Westkamp, 2013. "Stability and Competitive Equilibrium in Trading Networks," Journal of Political Economy, University of Chicago Press, vol. 121(5), pages 966-1005.
    17. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    18. Anna Bogomolnaia & Herve Moulin, 2004. "Random Matching Under Dichotomous Preferences," Econometrica, Econometric Society, vol. 72(1), pages 257-279, January.
    19. Dutta, Bhaskar & Mutuswami, Suresh, 1997. "Stable Networks," Journal of Economic Theory, Elsevier, vol. 76(2), pages 322-344, October.
      • Dutta, Bhaskar & Mutuswami, Suresh, 1996. "Stable Networks," Working Papers 971, California Institute of Technology, Division of the Humanities and Social Sciences.
    20. Okumura, Yasunori, 2014. "Priority matchings revisited," Games and Economic Behavior, Elsevier, vol. 88(C), pages 242-249.
    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. Joseph E. Duggan, 2020. "Subjective Homophily and the Fixtures Problem," Games, MDPI, vol. 11(1), pages 1-13, February.
    2. 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.

    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 & Kominers, Scott Duke, 2017. "Contract design and stability in many-to-many matching," Games and Economic Behavior, Elsevier, vol. 101(C), pages 78-97.
    2. Ana Mauleon & Nils Roehl & Vincent Vannetelbosch, 2014. "Constitutions and Social Networks," Working Papers CIE 74, Paderborn University, CIE Center for International Economics.
    3. Atay, Ata & Mauleon, Ana & Vannetelbosch, Vincent, 2021. "A bargaining set for roommate problems," Journal of Mathematical Economics, Elsevier, vol. 94(C).
    4. Nicolò, Antonio & Rodríguez-Álvarez, Carmelo, 2017. "Age-based preferences in paired kidney exchange," Games and Economic Behavior, Elsevier, vol. 102(C), pages 508-524.
    5. 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.
    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. Hideo Konishi & M. Utku Ünver, 2003. "Credible Group Stability in Multi-Partner Matching Problems," Working Papers 2003.115, Fondazione Eni Enrico Mattei.
    8. Hatfield, John William & Kominers, Scott Duke, 2015. "Multilateral matching," Journal of Economic Theory, Elsevier, vol. 156(C), pages 175-206.
    9. 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.
    10. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2019. "Paths to stability for overlapping group structures," Journal of Mathematical Economics, Elsevier, vol. 83(C), pages 19-24.
    11. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    12. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    13. 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.
    14. 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.
    15. 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.
    16. Mauleon, Ana & Roehl, Nils & Vannetelbosch, Vincent, 2018. "Constitutions and groups," Games and Economic Behavior, Elsevier, vol. 107(C), pages 135-152.
    17. 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.
    18. Bando, Keisuke & Hirai, Toshiyuki, 2021. "Stability and venture structures in multilateral matching," Journal of Economic Theory, Elsevier, vol. 196(C).
    19. Jean-Jacques Herings, P. & Mauleon, Ana & Vannetelbosch, Vincent, 2017. "Stable sets in matching problems with coalitional sovereignty and path dominance," Journal of Mathematical Economics, Elsevier, vol. 71(C), pages 14-19.
    20. Kojima, Fuhito & Tamura, Akihisa & Yokoo, Makoto, 2018. "Designing matching mechanisms under constraints: An approach from discrete convex analysis," Journal of Economic Theory, Elsevier, vol. 176(C), pages 803-833.

    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:72:y:2017:i:c:p:104-111. 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.