Abstract
This paper builds on Kojima and Pathak (2009)'s result of vanishing manipulability in large stable mechanisms. We show that convergence toward truth-telling in stable mechanisms can be achieved much faster if colleges' preferences are independently drawn from an uniform distribution. Another novelty from our results is that they can be applied to competitive environments in which virtually all vacancies end up being filled. So this paper adds evidence to the fact that, though stable matching mechanisms are not entirely strategy-proof, in practice, when the number of participants in the market is sufficiently large, they can be treated as being effectively strategy-proof.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
