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