An improved bound to manipulation in large stable matches

Gustavo Saraiva

Games and Economic Behavior, 2021, vol. 129, issue C, 55-77

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.

Keywords: Matching; Stability; Strategy-proofness; Large markets (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0899825621000622
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:gamebe:v:129:y:2021:i:c:p:55-77

DOI: 10.1016/j.geb.2021.05.005

Access Statistics for this article

Games and Economic Behavior is currently edited by E. Kalai

More articles in Games and Economic Behavior from Elsevier
Bibliographic data for series maintained by Catherine Liu ().