On the Invariance of the Set of Core Matchings with Respect to Preference Profiles
Abstract
We consider the general many-to-one matching model with ordinal preferences and give a procedure to partition the set of preference profiles into subsets with the property that all preference profiles in the same subset have the same Core. We also show how to identify a profile of (incomplete) binary relations containing the minimal information needed to generate as strict extensions all the (complete) preference profiles with the same Core. This is important for applications since it reduces the amount of information that agents have to reveal about their preference relations to centralized Core matching mechanisms; moreover, this reduction is maximal.Download Info
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.Bibliographic Info
Paper provided by Barcelona Graduate School of Economics in its series Working Papers with number 390.Length:
Date of creation: Jul 2009
Date of revision:
Handle: RePEc:bge:wpaper:390
Contact details of provider:
Postal: Ramon Trias Fargas, 25-27, 08005 Barcelona
Phone: +34 93 542-1222
Fax: +34 93 542-1223
Email:
Web page: http://www.barcelonagse.eu
More information through EDIRC
Related research
Keywords: Matching; Core;Other versions of this item:
- Martínez, Ruth & Massó, Jordi & Neme, Alejandro & Oviedo, Jorge, 2012. "On the invariance of the set of Core matchings with respect to preference profiles," Games and Economic Behavior, Elsevier, vol. 74(2), pages 588-600.
- Ruth Martínez & Jordi Massó & Alejandro Neme & Jorge Oviedo, 2009. "On the Invariance of the Set of Core Matchings with Respect to Preference Profiles," UFAE and IAE Working Papers 803.09, Unitat de Fonaments de l'Anàlisi Econòmica (UAB) and Institut d'Anàlisi Econòmica (CSIC).
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
References
References listed on IDEASPlease 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.:
- Federico Echenique & Jorge Oviedo, 2003.
"Core Many-to-one Matchings by Fixed-point Methods,"
Game Theory and Information
0302001, EconWPA.
- Echenique, Federico & Oviedo, Jorge, 2004. "Core many-to-one matchings by fixed-point methods," Journal of Economic Theory, Elsevier, vol. 115(2), pages 358-376, April.
- Echenique, Federico & Oviedo, Jorge, 2002. "Core Many-To-One Matchings by Fixed-Point Methods," Working Papers 1140, California Institute of Technology, Division of the Humanities and Social Sciences.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:bge:wpaper:390For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Bruno Guallar).
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.

