In a model with finitely many agents who have single-dipped Euclidean preferences on a disc in the Euclidean plane, a rule assigns to each profile of reported dips a point of the disc. It is proved that any strategy-proof and Pareto optimal rule is dictatorial. This framework models situations...

In a model with finitely many agents who have single-dipped Euclidean preferences on a polytope in the Euclidean plane, a rule assigns to each profile of reported dips a point of the polytope. A point <InlineEquation ID="IEq1"> <EquationSource Format="TEX">$$x$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>x</mi> </math> </EquationSource> </InlineEquation> of the polytope is called single-best if there is a point <InlineEquation ID="IEq2"> <EquationSource Format="TEX">$$y$$</EquationSource> <EquationSource Format="MATHML"> <math xmlns:xlink="http://www.w3.org/1999/xlink"> <mi>y</mi> </math> </EquationSource> </InlineEquation> of the...</equationsource></equationsource></inlineequation></equationsource></equationsource></inlineequation>

In this paper we characterize strategy-proof voting schemes on Euclidean spaces. A voting scheme is strategy-proof whenever it is optimal for every agent to report his best alternative. Here the individual preferences underlying these best choices are separable and quadratic. It turns out that a...

We consider the problem of reallocating the total initial endowments of an infinitely divisible commodity among agents with single-peaked preferences. With the uniform reallocation rule we propose a solution which satisfies many appealing properties, describing the effect of population and...

Under a k-approval scoring rule each agent attaches a score of one to his k most preferred alternatives and zero to the other alternatives. The rule assigns the set of alternatives with maximal score. Agents may extend preferences to sets in several ways: they may compare the worst alternatives,...

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