Stable Matching Mechanisms are Not Obviously Strategy-Proof
Computer Science and Game Theory
2018-07-19 v5
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
Cite
@article{arxiv.1511.00452,
title = {Stable Matching Mechanisms are Not Obviously Strategy-Proof},
author = {Itai Ashlagi and Yannai A. Gonczarowski},
journal= {arXiv preprint arXiv:1511.00452},
year = {2018}
}