Matching Through Position Auctions
This paper studies how an intermediary should design two-sided matching markets when agents are privately informed about their quality as a partner and can make payments to the intermediary. Using a mechanism design approach, I derive sufficient conditions for assortative matching to be profit- or welfare-maximizing, and then show how to implement the optimal match and payments through two-sided position auctions. This sharpens our understanding of intermediated matching markets by clarifying when assortative matching is a solution, and the nature of optimal price discrimination when there are cross-market externalities. An extension considers the case when the matchmaker cannot keep the reports or bids of the agents secret ex post, partially undermining his ability to block unprofitable matches.
|Date of creation:||Jul 2009|
|Date of revision:||Jan 2011|
|Contact details of provider:|| Postal: 434 Flanner Hall, Notre Dame, IN 46556|
Phone: (574) 631-7698
Web page: http://economics.nd.edu
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.:
- Board, Simon, 2009.
"Monopolistic group design with peer effects,"
Econometric Society, vol. 4(1), March.
- Jeremy Bulow & Jonathan Levin, 2005.
"Matching and Price Competition,"
NBER Working Papers
11506, National Bureau of Economic Research, Inc.
- Bulow, Jeremy I. & Levin, Jonathan, 2003. "Matching and Price Competition," Research Papers 1818, Stanford University, Graduate School of Business.
- Jonathan Levin & Jeremy Bulow, 2004. "Matching and Price Competition," Econometric Society 2004 North American Winter Meetings 350, Econometric Society.
- R. Preston McAfee, 2002. "Coarse Matching," Econometrica, Econometric Society, vol. 70(5), pages 2025-2034, September.
- Heidrun C. Hoppe & Benny Moldovanu & Aner Sela, 2009.
"The Theory of Assortative Matching Based on Costly Signals,"
Review of Economic Studies,
Oxford University Press, vol. 76(1), pages 253-281.
- 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.
- 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.
- 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 & Ilya Segal, 2002. "Envelope Theorems for Arbitrary Choice Sets," Econometrica, Econometric Society, vol. 70(2), pages 583-601, March.
- Damiano, Ettore & Li, Hao, 2005.
"Price Discrimination and Efficient Matching,"
Microeconomics.ca working papers
damiano-05-03-21-12-21-58, Vancouver School of Economics, revised 22 Mar 2005.
- Gary S. Becker, 1974.
"A Theory of Marriage: Part II,"
in: Marriage, Family, Human Capital, and Fertility, pages 11-26
National Bureau of Economic Research, Inc.
- Heidrun Hoppe & Benny Moldovanu & Emre Ozdenoren, 2011. "Coarse matching with incomplete information," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 47(1), pages 75-104, May.
- Michael Spence, 1973. "Job Market Signaling," The Quarterly Journal of Economics, Oxford University Press, vol. 87(3), pages 355-374.
When requesting a correction, please mention this item's handle: RePEc:nod:wpaper:001. 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: (Terence Johnson)
If references are entirely missing, you can add them using this form.