Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2, 2017 | Submitted
Report Open

Incentive Compatibility of Large Centralized Matching Markets

Lee, Sangmok

Abstract

This paper discusses the strategic manipulation of stable matching mechanisms. We provide a model of a two-sided matching market, in which a firm hires a worker, and each of them receives non-transferable utility. Assuming that the utilities are randomly drawn from underlying distributions, we measure the likelihood of differences in utilities from different stable matchings. Our key finding is that in large markets, most agents are close to being indifferent among partners in different stable matchings. Specifically, as the number of firms and workers becomes large, the expected proportion of firms and workers whose utilities from all stable matchings are within an arbitrarily small difference of one another converges to one. It is known that the utility gain by manipulating a stable matching mechanism is limited by the difference between utilities from the most and the least preferred stable matchings. Thus, the finding also implies that the expected proportion of agents who may obtain a significant utility gain from manipulation vanishes in large markets. This result reconciles successful stable mechanisms in practice with the theoretical concerns about strategic manipulation.

Additional Information

I am especially grateful to Federico Echenique, Matt Shum, and Leeat Yariv for encouragement and guidance. I also thank Hyoung-Jun Ahn, Kim Border, Ruth Mendel, Juan Sebastian Pereyra, Tom Ruchti, Bob Sherman, and seminar participants at Mid-west Economic Theory in Notre Dame, SISL, and the Summer 2011 Meeting of the Econometric Society for very helpful discussions.

Attached Files

Submitted - sswp1350.pdf

Files

sswp1350.pdf
Files (526.0 kB)
Name Size Download all
md5:fedfdb9d5751949ae6b3dd2d00a92032
526.0 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024