Advanced Search
MyIDEAS: Login to save this article or follow this journal

Group robust stability in matching markets

Contents:

Author Info

  • Oğuz Afacan, Mustafa
Registered author(s):

    Abstract

    We introduce the notion of group robust stability which requires robustness against a combined manipulation, first misreporting preferences and then rematching, by any group of students in the school choice type of matching markets. Our first result shows that there is no group robustly stable mechanism even under acyclic priority structures. Next, we define a weak version of group robust stability, called weak group robust stability. Our main theorem, then, proves that there is a weakly group robustly stable mechanism if and only if the priority structure of schools is acyclic, and in that case, it coincides with the student-optimal stable mechanism.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/pii/S0899825611001035
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal Games and Economic Behavior.

    Volume (Year): 74 (2012)
    Issue (Month): 1 ()
    Pages: 394-398

    as in new window
    Handle: RePEc:eee:gamebe:v:74:y:2012:i:1:p:394-398

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/inca/622836

    Related research

    Keywords: Matching; Stability; Group robust stability; Group strategy-proofness; Acyclicity; Combined manipulation;

    Find related papers by JEL classification:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Pathak, Parag A. & Abdulkadiroglu, Atila & Roth, Alvin, 2005. "The New York City High School Match," Scholarly Articles 2562765, Harvard University Department of Economics.
    2. Chakraborty, Archishman & Citanna, Alessandro & Ostrovsky, Michael, 2010. "Two-sided matching with interdependent values," Journal of Economic Theory, Elsevier, Elsevier, vol. 145(1), pages 85-105, January.
    3. Haluk I. Ergin, 2002. "Efficient Resource Allocation on the Basis of Priorities," Econometrica, Econometric Society, Econometric Society, vol. 70(6), pages 2489-2497, November.
    4. Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, Elsevier, vol. 36(2), pages 277-288, August.
    5. Kesten, Onur, 2006. "On two competing mechanisms for priority-based allocation problems," Journal of Economic Theory, Elsevier, Elsevier, vol. 127(1), pages 155-171, March.
    6. Kojima, Fuhito, 2011. "Robust stability in matching markets," Theoretical Economics, Econometric Society, Econometric Society, vol. 6(2), May.
    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 in new window

    Cited by:
    1. Afacan, Mustafa Oǧuz, 2013. "Application fee manipulations in matching markets," Journal of Mathematical Economics, Elsevier, vol. 49(6), pages 446-453.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:gamebe:v:74:y:2012:i:1:p:394-398. 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: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.