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.
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.
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.
Volume (Year): 7 (2007)
Issue (Month): 1 (September)
|Contact details of provider:|| Web page: https://www.degruyter.com|
|Order Information:||Web: https://www.degruyter.com/view/j/bejte|
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.:
- Bogomolnaia, Anna & Moulin, Herve, 2001. "A New Solution to the Random Assignment Problem," Journal of Economic Theory, Elsevier, vol. 100(2), pages 295-328, October.
- Shin, Sungwhee & Suh, Sang-Chul, 1996. "A mechanism implementing the stable rule in marriage problems," Economics Letters, Elsevier, vol. 51(2), pages 185-189, May.
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 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.