IDEAS home Printed from https://ideas.repec.org/a/eee/gamebe/v87y2014icp269-287.html
   My bibliography  Save this article

On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm

Author

Listed:
  • Bando, Keisuke

Abstract

This study analyzes a preference revelation game in the student-optimal deferred acceptance algorithm in a college admission problem. We assume that each college's true preferences are known publicly, and analyze the strategic behavior of students. We demonstrate the existence of a strictly strong Nash equilibrium in the preference revelation game through a simple algorithm that finds it. Specifically, (i) the equilibrium outcome from our algorithm is the same matching as in the efficiency-adjusted deferred acceptance algorithm and (ii) in a one-to-one matching market, it coincides with the student-optimal von Neumann–Morgenstern (vNM) stable matching. We also show that (i) when a strict core allocation in a housing market derived from a college admission market exists, it can be supported by a strictly strong Nash equilibrium, and (ii) there exists a strictly strong Nash equilibrium under the college-optimal deferred acceptance algorithm if and only if the student-optimal stable matching is Pareto-efficient for students.

Suggested Citation

  • Bando, Keisuke, 2014. "On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm," Games and Economic Behavior, Elsevier, vol. 87(C), pages 269-287.
  • Handle: RePEc:eee:gamebe:v:87:y:2014:i:c:p:269-287
    DOI: 10.1016/j.geb.2014.05.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0899825614000979
    Download Restriction: Full text for ScienceDirect subscribers only

    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. Caterina Calsamiglia & Guillaume Haeringer & Flip Klijn, 2010. "Constrained School Choice: An Experimental Study," American Economic Review, American Economic Association, vol. 100(4), pages 1860-1874, September.
    2. Marilda Sotomayor, 2008. "The stability of the equilibrium outcomes in the admission games induced by stable matching rules," International Journal of Game Theory, Springer;Game Theory Society, vol. 36(3), pages 621-640, March.
    3. Roth, Alvin E., 1984. "Misrepresentation and stability in the marriage problem," Journal of Economic Theory, Elsevier, vol. 34(2), pages 383-387, December.
    4. 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.
    5. Haluk I. Ergin, 2002. "Efficient Resource Allocation on the Basis of Priorities," Econometrica, Econometric Society, vol. 70(6), pages 2489-2497, November.
    6. Haeringer, Guillaume & Klijn, Flip, 2009. "Constrained school choice," Journal of Economic Theory, Elsevier, vol. 144(5), pages 1921-1947, September.
    7. Ehlers, Lars, 2007. "Von Neumann-Morgenstern stable sets in matching problems," Journal of Economic Theory, Elsevier, vol. 134(1), pages 537-547, May.
    8. Ahmet Alkan, 2002. "A class of multipartner matching markets with a strong lattice structure," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 19(4), pages 737-746.
    9. John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
    10. Shapley, Lloyd & Scarf, Herbert, 1974. "On cores and indivisibility," Journal of Mathematical Economics, Elsevier, vol. 1(1), pages 23-37, March.
    11. Thomas Quint & Jun Wako, 2004. "On Houseswapping, the Strict Core, Segmentation, and Linear Programming," Yale School of Management Working Papers ysm373, Yale School of Management.
    12. Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
    13. 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.
    14. Onur Kesten, 2010. "School Choice with Consent," The Quarterly Journal of Economics, Oxford University Press, vol. 125(3), pages 1297-1348.
    15. Roth, Alvin E. & Postlewaite, Andrew, 1977. "Weak versus strong domination in a market with indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 4(2), pages 131-137, August.
    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. repec:spr:sochwe:v:49:y:2017:i:2:d:10.1007_s00355-017-1060-x is not listed on IDEAS
    2. Paula Jaramillo & Cagatay Kayi & Flip Klijn, 2017. "School Choice: Nash Implementation of Stable Matchings through Rank-Priority Mechanisms," Documentos CEDE 015611, Universidad de los Andes - CEDE.
    3. repec:the:publsh:2482 is not listed on IDEAS
    4. Tang, Qianfeng & Yu, Jingsheng, 2014. "A new perspective on Kesten's school choice with consent idea," Journal of Economic Theory, Elsevier, vol. 154(C), pages 543-561.

    More about this item

    Keywords

    Student-optimal deferred acceptance algorithm; Strictly strong Nash equilibrium; Efficiency-adjusted deferred acceptance algorithm; Student-optimal vNM stable matching;

    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:eee:gamebe:v:87:y:2014:i:c:p:269-287. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/inca/622836 .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.