Punishment-Dominance Condition on Stable Two-Sided Matching Algorithms
In this article, we consider a many-to-one two-sided matching market and define a canonical strategic form game, in which any worker applies to the top k firms and is assigned to the most preferred firm that does not reject him/her. Under the substitute property of firms' preferences, the game satisfies the punishment-dominance condition. The deferred-acceptance algorithm by Gale and Shapley (Amer. Math. Monthly 69: 1962), which finds the maximum and minimum of stable matchings, is described as an instance of the algorithm by Masuzawa (Int. Jour. Game Theory 38: 2008), which determines the α-cores of the strategic form games with the punishment-dominance condition.
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.
| Length: | 14 pages |
| Date of creation: | Oct 2012 |
| Handle: | RePEc:kei:dpaper:2012-018 |
| Contact details of provider: | Postal: 2-15-45, Mita, Minato-ku, Tokyo 108-8345 Phone: +81-3-5418-6433 Fax: +81-3-5418-6447 Web page: http://ies.keio.ac.jp/old_project/old/gcoe-econbus/ Email: More information through EDIRC
|
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.:
- Ruud Hendrickx & Judith Timmer & Peter Borm, 2002.
"A note on NTU convexity,"
International Journal of Game Theory,
Springer;Game Theory Society, vol. 31(1), pages 29-37.
- Hendrickx, R.L.P. & Borm, P.E.M. & Timmer, J.B., 2002. "A note on NTU-convexity," Other publications TiSEM c8e46ca9-db92-4579-b793-4, Tilburg University, School of Economics and Management.
- John William Hatfield & Paul R. Milgrom, 2005. "Matching with Contracts," American Economic Review, American Economic Association, vol. 95(4), pages 913-935, September.
- Paul Milgrom, 2003. "Matching with Contracts," Working Papers 03003, Stanford University, Department of Economics.
- Roth, Alvin E, 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Journal of Political Economy, University of Chicago Press, vol. 92(6), pages 991-1016, December.
- Roth, Alvin E., 1984. "The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory," Scholarly Articles 29410143, Harvard University Department of Economics.
- 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. Full references (including those not matched with items on IDEAS)
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.
When requesting a correction, please mention this item's handle: RePEc:kei:dpaper:2012-018. 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: (Global COE Program Office)
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.