IDEAS home Printed from https://ideas.repec.org/p/wpa/wuwpga/0506005.html
   My bibliography  Save this paper

A Solution to Matching with Preferences over Colleagues

Author

Listed:
  • Federico Echenique

    (California Institute of Technology)

Abstract

We study many-to-one matchings, such as the assignment of students to colleges, where the students have preferences over the other students who would attend the same college. It is well known that the core of this model may be empty, without strong assumptions on agents' preferences. We introduce a method that finds all core matchings, if any exist. The method requires no assumptions on preferences. Our method also finds certain partial solutions that may be useful when the core is empty.

Suggested Citation

  • Federico Echenique, 2005. "A Solution to Matching with Preferences over Colleagues," Game Theory and Information 0506005, University Library of Munich, Germany.
  • Handle: RePEc:wpa:wuwpga:0506005
    Note: Type of Document - pdf; pages: 28
    as

    Download full text from publisher

    File URL: https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/0506/0506005.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Echenique, Federico, 2007. "Counting combinatorial choice rules," Games and Economic Behavior, Elsevier, vol. 58(2), pages 231-245, February.
    2. Klaus, Bettina & Klijn, Flip, 2005. "Stable matchings and preferences of couples," Journal of Economic Theory, Elsevier, vol. 121(1), pages 75-106, March.
    3. Von Stengel, Bernhard, 2002. "Computing equilibria for two-person games," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 3, chapter 45, pages 1723-1759, Elsevier.
    4. Bettina Klaus & Flip Klijn & Toshifumi Nakamura, 2005. "Corrigendum: Stable Matchings and Preferences of Couples," Working Papers 261, Barcelona School of Economics.
    5. 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.
    6. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    7. Echenique, Federico & Oviedo, Jorge, 2004. "Core many-to-one matchings by fixed-point methods," Journal of Economic Theory, Elsevier, vol. 115(2), pages 358-376, April.
    8. Bogomolnaia, Anna & Jackson, Matthew O., 2002. "The Stability of Hedonic Coalition Structures," Games and Economic Behavior, Elsevier, vol. 38(2), pages 201-230, February.
    9. Pablo Revilla, 2004. "Many-to-one Matching When Colleagues Matter," Economic Working Papers at Centro de Estudios Andaluces E2004/85, Centro de Estudios Andaluces.
    10. 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.
    11. Adachi, Hiroyuki, 2000. "On a characterization of stable matchings," Economics Letters, Elsevier, vol. 68(1), pages 43-49, July.
    12. Roth, Alvin E. & Sotomayor, Marilda, 1992. "Two-sided matching," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 1, chapter 16, pages 485-541, Elsevier.
    13. Greenberg, Joseph, 1994. "Coalition structures," Handbook of Game Theory with Economic Applications, in: R.J. Aumann & S. Hart (ed.), Handbook of Game Theory with Economic Applications, edition 1, volume 2, chapter 37, pages 1305-1337, Elsevier.
    14. Dutta, Bhaskar & Masso, Jordi, 1997. "Stability of Matchings When Individuals Have Preferences over Colleagues," Journal of Economic Theory, Elsevier, vol. 75(2), pages 464-475, August.
    15. Michael Ostrovsky, 2008. "Stability in Supply Chain Networks," American Economic Review, American Economic Association, vol. 98(3), pages 897-923, June.
    16. 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.
    17. Martinez, Ruth & Masso, Jordi & Neme, Alejandro & Oviedo, Jorge, 2004. "An algorithm to compute the full set of many-to-many stable matchings," Mathematical Social Sciences, Elsevier, vol. 47(2), pages 187-210, March.
    18. 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.
    19. 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.
    20. McKelvey, Richard D. & McLennan, Andrew, 1996. "Computation of equilibria in finite games," Handbook of Computational Economics, in: H. M. Amman & D. A. Kendrick & J. Rust (ed.), Handbook of Computational Economics, edition 1, volume 1, chapter 2, pages 87-142, Elsevier.
    21. John W. Hatfield & Paul Milgrom, 2005. "Auctions, Matching and the Law of Aggregate Demand," Levine's Bibliography 122247000000000780, UCLA Department of Economics.
    22. Alvin E. Roth, 1982. "The Economics of Matching: Stability and Incentives," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 617-628, 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. 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.
    2. 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.
    3. Dimitrov, Dinko & Lazarova, Emiliya A., 2008. "Coalitional Matchings," Coalition Theory Network Working Papers 37523, Fondazione Eni Enrico Mattei (FEEM).
    4. Juárez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022. "Lattice structure of the random stable set in many-to-many matching markets," Games and Economic Behavior, Elsevier, vol. 132(C), pages 255-273.
    5. Bando, Keisuke, 2014. "A modified deferred acceptance algorithm for many-to-one matching markets with externalities among firms," Journal of Mathematical Economics, Elsevier, vol. 52(C), pages 173-181.
    6. Dimitrov, Dinko & Lazarova, Emiliya, 2011. "Two-sided coalitional matchings," Mathematical Social Sciences, Elsevier, vol. 62(1), pages 46-54, July.
    7. 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.
    8. 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.
    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. 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.
    11. 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.
    12. Tam'as Fleiner & Zsuzsanna Jank'o & Akihisa Tamura & Alexander Teytelboym, 2015. "Trading Networks with Bilateral Contracts," Papers 1510.01210, arXiv.org, revised May 2018.
    13. Chao Huang, 2021. "Stable matching: an integer programming approach," Papers 2103.03418, arXiv.org, revised Apr 2022.
    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. , & ,, 2006. "A theory of stability in many-to-many matching markets," Theoretical Economics, Econometric Society, vol. 1(2), pages 233-273, June.
    16. Chao Huang, 2022. "Firm-worker hypergraphs," Papers 2211.06887, arXiv.org, revised Nov 2023.
    17. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    18. Bonifacio, Agustín G. & Guiñazú, Nadia & Juarez, Noelia & Neme, Pablo & Oviedo, Jorge, 2022. "The lattice of worker-quasi-stable matchings," Games and Economic Behavior, Elsevier, vol. 135(C), pages 188-200.
    19. 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.
    20. Tamás Fleiner & Zsuzsanna Jankó & Ildikó Schlotter & Alexander Teytelboym, 2023. "Complexity of stability in trading networks," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 629-648, September.

    More about this item

    Keywords

    Two-sided Matching; Core; Externalities; Lattice; Tarski's Fixed Point Theorem; Gale-Shapley Algorithm;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory

    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:wpa:wuwpga:0506005. 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: EconWPA (email available below). General contact details of provider: https://econwpa.ub.uni-muenchen.de .

    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.