Minimal Manipulability: Anonymity and Unanimity

This paper is concerned with the minimal number of profiles at which a unanimous and anonymous social choice function for three alternatives is manipulable. The lower bound is derived and examples of social choice functions attaining the lower bound are given. It is conjectured that these social choice functions are in fact all minimally manipulable social choice functions. Since some of these social choice functions are pareto optimal, it follows that the lower bound also holds for pareto optimal and anonymous social choice functions. Some of the minimally manipulable pareto optimal and anonymous social choice functions can be interpreted as status quo voting