STATISTICAL MANIPULATABILITY OF SOCIAL CHOICE FUNCTIONS

We consider the proportion of profiles at which an anonymous neutral s ocial choice function cannot be manipulated to any coalition's advanta ge. We fix the number of alternatives and consider the limit as the nu mber of individuals goes to infinity, and assume that the limit of the fraction of all profiles in the domain is 1. We show that there is a continuous function on ''profile vectors'' which gives the maximum pro bability of strategy-proofness, and that this is strictly between 0 an d 1 for three alternatives. We also analyze a number of common social choice functions along these lines.