Manipulability of Stable Mechanisms
研究了稳定匹配机制的可操纵性，发现机制的可操纵性比较等价于代理人的偏好比较：一个机制比另一个更可操纵，当且仅当代理人更偏好后者。
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 when agents on one side of the market have unit demand, no stable matching mechanism is less manipulable than another for all agents.