When Can Manipulations be Avoided in Two-Sided Matching Markets? -- Maximal Domain Results
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.
Volume (Year): 7 (2007)
Issue (Month): 1 (September)
|Contact details of provider:|| Web page: http://www.degruyter.com|
|Order Information:||Web: http://www.degruyter.com/view/j/bejte|
When requesting a correction, please mention this item's handle: RePEc:bpj:bejtec:v:7:y:2007:i:1:n:32. 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: (Peter Golla)
If references are entirely missing, you can add them using this form.