Manipulability of Stable Mechanisms
17 Pages Posted: 19 Nov 2014 Last revised: 3 Feb 2015
Date Written: January 2015
We study the manipulability of stable matching mechanisms and show that manipulability comparisons are equivalent to preference comparisons: for any agent, a mechanism is more manipulable than another if and only if this agent prefers the latter to the former. One important implication is that no stable matching mechanism is less manipulable than another for all agents.
Keywords: matching with contract, manipulability, preference ranking, stable mechanism
JEL Classification: C71, C78
Suggested Citation: Suggested Citation