On Asymptotic Strategy-Proofness of Classical Social Choice Rules

Arkadii Slinko

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})$.

Keywords
Majority relation, scoring rule, asymptotic strategy-proofness

Math Review Classification
Primary 90A08

Last Updated
10 October 2000

Length
9 pages

Availability
This article is available in: