Signal to noise in matching markets

In many matching markets, one side "applies" to the other, and these applications are often expensive and time-consuming (e.g. students applying to college). It is tempting to think that making the application process easier should benefit both sides of the market. After all, the applicants could submit more applications, and the recipients would have more applicants to choose from. In this paper, we propose and analyze a simple model to understand settings where both sides of the market suffer from increased number of applications. The main insights of the paper are derived from quantifying the signal to noise tradeoffs in random matchings, as applications provide a signal of the applicants' preferences. When applications are costly the signal is stronger, as the act of making an application itself is meaningful. Therefore more applications may yield potentially better matches, but fewer applications create stronger signals for the receiving side to learn true preferences. We derive analytic characterizations of the expected quality of stable matchings in a simple utility model where applicants have an overall quality, but also synergy with specific possible partners. Our results show how reducing application cost without introducing an effective signaling mechanism might lead to inefficiencies for both sides of the market.

[1]  Rajeev Motwani,et al.  Stable husbands , 1990, SODA '90.

[2]  Toby Walsh,et al.  Manipulation complexity and gender neutrality in stable marriage procedures , 2009, Autonomous Agents and Multi-Agent Systems.

[3]  Donald E. Knuth Mariages stables et leurs relations avec d'autres problèmes combinatoires : introduction à l'analyse mathématique des algorithmes , 1976 .

[4]  Robert W. Irving,et al.  The Stable marriage problem - structure and algorithms , 1989, Foundations of computing series.

[5]  A. Roth,et al.  Turnaround Time and Bottlenecks in Market Clearing: Decentralized Matching in the Market for Clinical Psychologists , 1997, Journal of Political Economy.

[6]  N. Arnosti Centralized Clearinghouse Design: A Quantity-Quality Tradeoff , 2016 .

[7]  L. B. Wilson,et al.  The stable marriage problem , 1971, Commun. ACM.

[8]  Parag A. Pathak,et al.  Appendix to "Incentives and Stability in Large Two-Sided Matching Markets" , 2009 .

[9]  Nicole Immorlica,et al.  Incentives in Large Random Two-Sided Markets , 2015, TEAC.

[10]  Aravind Srinivasan,et al.  Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds , 1997, SIAM J. Comput..

[11]  A. Roth,et al.  The Job Market for New Economists: A Market Design Perspective , 2010 .

[12]  Hanna Halaburda,et al.  Competing by Restricting Choice: The Case of Search Platforms , 2016 .

[13]  Itai Ashlagi,et al.  Optimal allocation without money: an engineering approach , 2014, Manag. Sci..

[14]  Ehud Friedgut,et al.  Sisterhood in the Gale-Shapley Matching Algorithm , 2011, Electron. J. Comb..

[15]  M. Niederle,et al.  Propose with a rose? Signaling in internet dating markets , 2011 .

[16]  Alvin E. Roth,et al.  The Economics of Matching: Stability and Incentives , 1982, Math. Oper. Res..

[17]  A. Roth The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game Theory , 1984, Journal of Political Economy.

[18]  Russell Impagliazzo,et al.  Constructive Proofs of Concentration Bounds , 2010, APPROX-RANDOM.

[19]  Tomomi Matsui,et al.  Successful Manipulation in Stable Marriage Model with Complete Preference Lists , 2009, IEICE Trans. Inf. Syst..

[20]  David Gale,et al.  Some remarks on the stable matching problem , 1985, Discret. Appl. Math..

[21]  Itai Ashlagi,et al.  Assigning More Students to their Top Choices: A Tiebreaking Rule Comparison , 2015, EC.

[22]  I. Ashlagi,et al.  What matters in tie-breaking rules ? How competition guides design PRELIMINARY DRAFT , 2015 .

[23]  L. S. Shapley,et al.  College Admissions and the Stability of Marriage , 2013, Am. Math. Mon..

[24]  Boris G. Pittel,et al.  The Average Number of Stable Matchings , 1989, SIAM J. Discret. Math..