IDEAS home Printed from https://ideas.repec.org/a/spr/reecde/v7y2002i2p117-134.html
   My bibliography  Save this article

original papers : Stable matchings and the small core in Nash equilibrium in the college admissions problem

Author

Listed:
  • Jinpeng Ma

    (Department of Economics, Rutgers University, Camden, NJ 08102, USA)

Abstract

Both rematching proof and strong equilibrium outcomes are stable with respect to the true preferences in the marriage problem. We show that not all rematching proof or strong equilibrium outcomes are stable in the college admissions problem. But we show that both rematching proof and strong equilibrium outcomes in truncations at the match point are all stable in the college admissions problem. Further, all true stable matchings can be achieved in both rematching proof and strong equilibrium in truncations at the match point. We show that any Nash equilibrium in truncations admits one and only one matching, stable or not. Therefore, the core at a Nash equilibrium in truncations must be small. But examples exist such that the set of stable matchings with respect to a Nash equilibrium may contain more than one matching. Nevertheless, each Nash equilibrium can only admit at most one true stable matching. If, indeed, there is a true stable matching at a Nash equilibrium, then the only possible equilibrium outcome will be the true stable matching, no matter how different are players' equilibrium strategies from the true preferences and how many other unstable matchings are there at that Nash equilibrium. Thus, we show that a necessary and sufficient condition for the stable matching rule to be implemented in a subset of Nash equilibria by the direct revelation game induced by a stable mechanism is that every Nash equilibrium profile in that subset admits one and only one true stable matching.

Suggested Citation

  • Jinpeng Ma, 2002. "original papers : Stable matchings and the small core in Nash equilibrium in the college admissions problem," Review of Economic Design, Springer;Society for Economic Design, vol. 7(2), pages 117-134.
    • Handle: RePEc:spr:reecde:v:7:y:2002:i:2:p:117-134
    Note: Received: 30 December 1998 / Accepted: 12 October 2001
    as

    Download full text from publisher

    File URL: http://link.springer.de/link/service/journals/10058/papers/2007002/20070117.pdf
    Download Restriction: Access to the full text of the articles in this series is restricted
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Marilda Sotomayor, 2012. "A further note on the college admission game," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(1), pages 179-193, February.
    2. Ehlers, Lars & Massó, Jordi, 2015. "Matching markets under (in)complete information," Journal of Economic Theory, Elsevier, vol. 157(C), pages 295-314.
    3. Ma, Jinpeng, 2010. "The singleton core in the college admissions problem and its application to the National Resident Matching Program (NRMP)," Games and Economic Behavior, Elsevier, vol. 69(1), pages 150-164, May.
    4. EHLERS, Lars & MASSO, Jordi, 2018. "Robust design in monotonic matching markets: A case for firm-proposing deferred-acceptance," Cahiers de recherche 2018-02, Universite de Montreal, Departement de sciences economiques.
    5. 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.
    6. 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.
    7. Ayşe Yazıcı, 2017. "Probabilistic stable rules and Nash equilibrium in two-sided matching problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(1), pages 103-124, March.
    8. Jaeok Park, 2017. "Competitive equilibrium and singleton cores in generalized matching problems," International Journal of Game Theory, Springer;Game Theory Society, vol. 46(2), pages 487-509, May.

    More about this item

    Keywords

    Stable matchings; Nash equilibrium; college admissions problem;
    All these keywords.

    JEL classification:

    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations

    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:spr:reecde:v:7:y:2002:i:2:p:117-134. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.