On Asymptotic Strategy-Proofness of Classical Social Choice Rules

Abstract

We show that, when the number of voters $n$ tends to infinity, all classical social choice rules are asymptotically strategy-proof with the proportion of manipulable profiles being of order $O(1/sqrt{n})$.