Location of Repository

Two-Sided Matching Markets? – Maximal Domain Results ∗

By  and Fuhito Kojima and Fuhito Kojima


In two-sided matching markets, stable mechanisms are vulnerable to various kinds of manipulations. This paper investigates conditions for the student-optimal stable mechanism (SOSM) and the college-optimal stable mechanism (COSM) to be immune to manipulations via capacities and pre-arranged matches. For SOSM, we find that strongly monotone preferences in populations and weakly maximin preferences are the maximal domains of college preferences that guarantee immunity to manipulations via capacities and pre-arranged matches, respectively. In contrast, COSM is susceptible to both manipulations whenever colleges have multiple positions

Topics: two-sided matching, stability, manipulation via capacities, manipulation via prearranged
Year: 2011
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://sites.google.com/site/f... (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.