IDEAS home Printed from https://ideas.repec.org/p/hal/journl/halshs-00670980.html
   My bibliography  Save this paper

A Further Note on the Stable Matching Problem

Author

Listed:
  • Gabrielle Demange

    (CECO - Laboratoire d'économétrie de l'École polytechnique - X - École polytechnique - IP Paris - Institut Polytechnique de Paris - CNRS - Centre National de la Recherche Scientifique)

  • David Gale

    (Department of Economics [Berkeley] - UC Berkeley - University of California [Berkeley] - UC - University of California)

  • Marilda Sotomayor

    (PUC-Rio - Pontifícia Universidade Católica do Rio de Janeiro [Brasil] = Pontifical Catholic University of Rio de Janeiro [Brazil] = Université catholique pontificale de Rio de Janeiro [Brésil])

Abstract

Using a lemma of J.S. Hwang we obtain a generalization of a theorem of Dubins and Freedman. It is shown that the core of the matching game is non-manipulable in a suitable sense by coalitions consisting of both men and women. A further strong stability property of the core is derived.

Suggested Citation

  • Gabrielle Demange & David Gale & Marilda Sotomayor, 1987. "A Further Note on the Stable Matching Problem," Post-Print halshs-00670980, HAL.
  • Handle: RePEc:hal:journl:halshs-00670980
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    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. Takashi Akahoshi, 2014. "A necessary and sufficient condition for stable matching rules to be strategy-proof," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 43(3), pages 683-702, October.
    3. Antonio Romero-Medina & Matteo Triossi, 2021. "Two-sided strategy-proofness in many-to-many matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(1), pages 105-118, March.
    4. Kara, Tarik & Sonmez, Tayfun, 1996. "Nash Implementation of Matching Rules," Journal of Economic Theory, Elsevier, vol. 68(2), pages 425-439, February.
    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. Blum, Yosef & Roth, Alvin E. & Rothblum, Uriel G., 1997. "Vacancy Chains and Equilibration in Senior-Level Labor Markets," Journal of Economic Theory, Elsevier, vol. 76(2), pages 362-411, October.
    7. Vicki Knoblauch, 2007. "Marriage Matching: A Conjecture of Donald Knuth," Working papers 2007-15, University of Connecticut, Department of Economics.
    8. Kóczy Á., László, 2009. "Központi felvételi rendszerek. Taktikázás és stabilitás [Central admission systems. Stratagems and stability]," Közgazdasági Szemle (Economic Review - monthly of the Hungarian Academy of Sciences), Közgazdasági Szemle Alapítvány (Economic Review Foundation), vol. 0(5), pages 422-442.
    9. 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.
    10. Ayse Mumcu & Ismail Saglam, 2019. "Strategic Issues in One-to-One Matching with Externalities Abstract:," Working Papers 2019/03, Bogazici University, Department of Economics.
    11. Amlendu Kumar Dubey, 2010. "Initial Allocation of Emissions Permits in the Two-Sided Matching Framework," Journal of Quantitative Economics, The Indian Econometric Society, vol. 8(1), pages 95-104, January.
    12. Mumcu, Ayse & Saglam, Ismail, 2006. "One-to-One Matching with Interdependent Preferences," MPRA Paper 1908, University Library of Munich, Germany.
    13. Fujinaka, Yuji & Wakayama, Takuma, 2015. "Maximal manipulation of envy-free solutions in economies with indivisible goods and money," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 165-185.
    14. Vicki Knoblauch, 2009. "Marriage matching and gender satisfaction," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 32(1), pages 15-27, January.
    15. Gutin, Gregory Z. & Neary, Philip R. & Yeo, Anders, 2023. "Unique stable matchings," Games and Economic Behavior, Elsevier, vol. 141(C), pages 529-547.
    16. AyÅŸe Mumcu & Ismail Saglam, 2021. "Strategic Issues in One-to-One Matching with Externalities," International Game Theory Review (IGTR), World Scientific Publishing Co. Pte. Ltd., vol. 23(02), pages 1-12, June.
    17. David Cantala & Francisco Sánchez, 2008. "Welfare and stability in senior matching markets," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 369-392, March.
    18. Hans Gersbach & Hans Haller, 2015. "Matching on Bipartite Graphs," CESifo Working Paper Series 5575, CESifo.
    19. 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.
    20. Itai Ashlagi & Mark Braverman & Yash Kanoria & Peng Shi, 2020. "Clearing Matching Markets Efficiently: Informative Signals and Match Recommendations," Management Science, INFORMS, vol. 66(5), pages 2163-2193, May.

    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:hal:journl:halshs-00670980. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.