In a model with a continuum of voters with symmetric single-peaked preferences on the one-dimensional unit interval (representing the political spectrum) a voting rule assigns to each profile of votes a point in the interval. We characterize all voting rules that are strategy-proof, anonymous,...

This paper is concerned with the minimal number of profiles at which a unanimous and anonymous social choice function is manipulable. The lower bound is derived when there are three alternatives to choose from. Examples of social choice functions attaining the lower bound are given. We...

We compare the manipulability of different choice rules by considering the number of manipulable profiles. We establish the minimal number of such profiles for tops-only, anonymous, and surjective choice rules, and show that this number is attained by unanimity rules with status quo.

Gibbard''s (1973) and Satterthwaite''s (1975) result implies that anonymous surjective social choice functions on more than two alternatives are manipulable. Placing some mild constraints on the number of agents compared to the number of alternatives, we show what the minimal number of...

A game form constitutionally implements a social choice correspondence if it implements it in Nash equilibrium and, moreover, the associated effectivity functions coincide. This paper presents necessary and sufficient conditions for a unanimous social choice correspondence to be constitutionally...

In voting problems where agents have well behaved (Lipschitz continuous) utility functions on a multidimensional space of alternatives, a voting rule is threshold strategy-proof if any agent can only obtain a limited utility gain by not voting for a most preferred alternative,given that the...

This paper is concerned with the number of profiles at which a nondictatorial social choice function is manipulable. For three or more alternatives the lower bound is derived when the social choice function is nondictatorial and unanimous. In the case of three alternatives the lower bound is...

Gibbard''s (1973) and Satterthwaite''s (1975) result implies that anonymous surjective social choice functions on more than two alternatives are manipulable. Placing some mild constraints on the number of agents compared to the number of alternatives, we show what the minimal number of...