Stable matching mechanisms are not obviously strategy-proof

Itai Ashlagi and Yannai A. Gonczarowski

Journal of Economic Theory, 2018, vol. 177, issue C, 405-425

Abstract: Many two-sided matching markets, from labor markets to school choice programs, use a clearinghouse based on the applicant-proposing deferred acceptance algorithm, which is well known to be strategy-proof for the applicants. Nonetheless, a growing amount of empirical evidence reveals that applicants misrepresent their preferences when this mechanism is used. This paper shows that no mechanism that implements a stable matching is obviously strategy-proof for any side of the market, a stronger incentive property than strategy-proofness that was introduced by Li (2017). A stable mechanism that is obviously strategy-proof for applicants is introduced for the case in which agents on the other side have acyclical preferences.

Keywords: Stable matching; Obviously strategy-proof; Obvious strategy-proofness; Matching; Mechanism (search for similar items in EconPapers)
JEL-codes: D4 D47 (search for similar items in EconPapers)
Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (53)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0022053118303454
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:jetheo:v:177:y:2018:i:c:p:405-425

DOI: 10.1016/j.jet.2018.07.001

Access Statistics for this article

Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell

More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Catherine Liu ().