Group Robust Stability in Matching Markets

Mustafa Afacan

No 09-019, Discussion Papers from Stanford Institute for Economic Policy Research

Abstract: We propose a group robust stability notion which requires robustness against a combined manipulation, first misreporting of preferences and then rematching, by any group of students in a school choice type of matching markets. Our first result shows that there is no group robustly stable mechanism even under acyclic priority structures (Ergin (2002)). Then, we define a weak version of group robust stability, called weak group robust stability. Our main theorem shows that there is a weakly group robustly stable mechanism if and only if the priority structure is acyclic, and in that case it coincides with the student-optimal stable mechanism. Hence this result generalizes the main theorem of Kojima (2010). Then as a real-world practice, we add uncertainty regarding an acceptance of an appeal of students to rematch after the announced matching. In that setting, we show that under some conditions along with the acyclicity, the student-optimal stable mechanism is group robustly stable under uncertainty.

Keywords: group stability mechansim; group robust stability; student-optimal stable mechanism (search for similar items in EconPapers)
JEL-codes: A10 (search for similar items in EconPapers)
Date: 2010-06
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www-siepr.stanford.edu/repec/sip/09-019.pdf (application/pdf)

Related works:
Journal Article: Group robust stability in matching markets (2012)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sip:dpaper:09-019

Access Statistics for this paper

More papers in Discussion Papers from Stanford Institute for Economic Policy Research Contact information at EDIRC.
Bibliographic data for series maintained by Anne Shor ( this e-mail address is bad, please contact ).