Threshold strategy-proofness: On manipulability in large voting systems

In voting problems where agents have well behaved (Lipschitz contin-uous) 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 number of agents is large enough. For anonymous vot-ing rules it is shown that this condition is not only implied by but in fact equivalent to the influence of any single agent reducing to zero as the number of agents grows. If there are at least five agents, the mean rule (taking the average vote) is shown to be the unique anonymous and unanimous voting rule that meets a lower bound with respect to the number of agents needed to obtain threshold strategy-proofness