Matching with Incomplete Information
A large literature uses matching models to analyze markets with two-sided heterogeneity, studying problems such as the matching of students to schools, residents to hospitals, husbands to wives, and workers to firms. The analysis typically assumes that the agents have complete information, and examines core outcomes. We formulate a notion of stable outcomes in matching problems with one-sided asymmetric information. The key conceptual problem is to formulate a notion of a blocking pair that takes account of the inferences that the uninformed agent might make from the hypothesis that the current allocation is stable. We show that the set of stable outcomes is nonempty in incomplete information environments, and is a superset of the set of complete-information stable outcomes. We provide sufficient conditions for incomplete-information stable matchings to be efficient.
|Date of creation:||Aug 2012|
|Date of revision:|
|Contact details of provider:|| Postal: Yale University, Box 208281, New Haven, CT 06520-8281 USA|
Phone: (203) 432-3702
Fax: (203) 432-6167
Web page: http://cowles.yale.edu/
More information through EDIRC
|Order Information:|| Postal: Cowles Foundation, Yale University, Box 208281, New Haven, CT 06520-8281 USA|
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.:
- Rajiv Vohra & Bhaskar Dutta, 2003.
"Incomplete Information, Credibility and the Core,"
2003-21, Brown University, Department of Economics.
- Forges Francoise, 1994.
Games and Economic Behavior,
Elsevier, vol. 6(2), pages 238-261, March.
- FORGES, FranÃ§oise, . "Posterior efficiency," CORE Discussion Papers RP 1077, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Forges, F., 1991. "Posterior efficiency," CORE Discussion Papers 1991045, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2007.
"Internet Advertising and the Generalized Second-Price Auction: Selling Billions of Dollars Worth of Keywords,"
American Economic Review,
American Economic Association, vol. 97(1), pages 242-259, March.
- Benjamin Edelman & Michael Ostrovsky & Michael Schwarz, 2005. "Internet Advertising and the Generalized Second Price Auction: Selling Billions of Dollars Worth of Keywords," NBER Working Papers 11765, National Bureau of Economic Research, Inc.
- Stephan Lauermann & Georg Nöldeke, 2012. "Stable Marriages and Search Frictions," Working papers 2012/10, Faculty of Business and Economics - University of Basel.
- Chade, Hector, 2006. "Matching with noise and the acceptance curse," Journal of Economic Theory, Elsevier, vol. 129(1), pages 81-113, July.
- repec:oup:restud:v:76:y:2009:i:1:p:253-281 is not listed on IDEAS
- Chade, H. & Lewis, Gregory & Smith, L., 2014.
"Student Portfolios and the College Admissions Problem,"
12363836, Harvard University Department of Economics.
- Alessandro Citanna & Archishman Chakraborty & Michael Ostrovsky, 2010.
"Two-sided matching with interdependent values,"
- Hoppe, Heidrun C. & Moldovanu, Benny & Sela, Aner, 2006.
"The Theory of Assortative Matching Based on Costly Signals,"
CEPR Discussion Papers
5543, C.E.P.R. Discussion Papers.
- Hoppe, Heidrun C. & Moldovanu, Benny & Sela, Aner, 2005. "The Theory of Assortative Matching Based on Costly Signals," Discussion Paper Series of SFB/TR 15 Governance and the Efficiency of Economic Systems 85, Free University of Berlin, Humboldt University of Berlin, University of Bonn, University of Mannheim, University of Munich.
- Ehlers, Lars & Masso, Jordi, 2007. "Incomplete information and singleton cores in matching markets," Journal of Economic Theory, Elsevier, vol. 136(1), pages 587-600, September.
When requesting a correction, please mention this item's handle: RePEc:cwl:cwldpp:1870. 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: (Matthew C. Regan)
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.