The Blocking Lemma for a many-to-one matching model
The Blocking Lemma identifies a particular blocking pair for each non-stable and individually rational matching that is preferred by some agents of one side of the market to their optimal stable matching. Its interest lies in the fact that it has been an instrumental result to prove key results on matching. For instance, the fact that in the college admissions problem the workers-optimal stable mechanism is group strategy-proof for the workers and the strong stability theorem in the marriage model follow directly from the Blocking Lemma. However, it is known that the Blocking Lemma and its consequences do not hold in the general many-to-one matching model in which firms have substitutable preference relations. We show that the Blocking Lemma holds for the many-to-one matching model in which firms' preference relations are, in addition to substitutable, quota q-separable. We also show that the Blocking Lemma holds on a subset of substitutable preference profiles if and only if the workers-optimal stable mechanism is group strategy-proof for the workers on this subset of profiles.
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.
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.:
- Barbera, Salvador & Sonnenschein, Hugo & Zhou, Lin, 1991.
"Voting by Committees,"
Econometric Society, vol. 59(3), pages 595-609, May.
- Salvador Barbera & Hugo Sonnenschein & Lin Zhou, 1990. "Voting by Committees," Cowles Foundation Discussion Papers 941, Cowles Foundation for Research in Economics, Yale University.
- Barbera, S. & Sonnenschein, H., 1988. "Voting By Quota And Committee," UFAE and IAE Working Papers 95-88, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Sonmez, T., 1995.
"Strategy-Proofness in Many-To-One Matching Problems,"
95-01, Michigan - Center for Research on Economic & Social Theory.
- Tayfun Sönmez, 1994. "Strategy-proofness in many-to-one matching problems," Review of Economic Design, Springer;Society for Economic Design, vol. 1(1), pages 365-380, December.
- Roth, Alvin E & Xing, Xiaolin, 1994. "Jumping the Gun: Imperfections and Institutions Related to the Timing of Market Transactions," American Economic Review, American Economic Association, vol. 84(4), pages 992-1044, September.
- Roth, Alvin E, 1984. "Stability and Polarization of Interests in Job Matching," Econometrica, Econometric Society, vol. 52(1), pages 47-57, January.
- Kelso, Alexander S, Jr & Crawford, Vincent P, 1982. "Job Matching, Coalition Formation, and Gross Substitutes," Econometrica, Econometric Society, vol. 50(6), pages 1483-1504, November.
- Dutta, Bhaskar & Masso, Jordi, 1997.
"Stability of Matchings When Individuals Have Preferences over Colleagues,"
Journal of Economic Theory,
Elsevier, vol. 75(2), pages 464-475, August.
- Dutta, B. & Masso, J., 1996. "Stability of Matchings when Individuals Have Preferences Over Colleagues," UFAE and IAE Working Papers 325.96, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Lars Ehlers & Bettina Klaus, 2003. "Coalitional strategy-proof and resource-monotonic solutions for multiple assignment problems," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 21(2), pages 265-280, October.
- Ruth Mart?ez & Jordi MassóAuthor-Email: email@example.com & Alejandro Neme & Jorge Oviedo, 2003.
"On group strategy-proof mechanisms for a many-to-one matching model,"
UFAE and IAE Working Papers
577.03, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- Ruth Martínez & Jordi Massó & Alejdanro Neme & Jorge Oviedo, 2004. "On group strategy-proof mechanisms for a many-to-one matching model," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(1), pages 115-128, January.
- Roth, Alvin E., 1985. "The college admissions problem is not equivalent to the marriage problem," Journal of Economic Theory, Elsevier, vol. 36(2), pages 277-288, August.
- Ahmet Alkan, 2001. "original papers : On preferences over subsets and the lattice structure of stable matchings," Review of Economic Design, Springer;Society for Economic Design, vol. 6(1), pages 99-111.
- Martinez, Ruth & Masso, Jordi & Neme, Alejandro & Oviedo, Jorge, 2000. "Single Agents and the Set of Many-to-One Stable Matchings," Journal of Economic Theory, Elsevier, vol. 91(1), pages 91-105, March.
When requesting a correction, please mention this item's handle: RePEc:eee:mateco:v:46:y:2010:i:5:p:937-949. 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: (Dana Niculescu)
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.