A mechanism is strategy-proof if agents can never profitably manipulate, in any state of the world; however, not all non-strategy-proof mechanisms are equally easy to manipulate - some are more "obviously" manipulable than others. We propose a formal definition of an obvious manipulation and...

We study 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. In particular, this implies that no two...

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...