A note on manipulability of large voting schemes

A voting system is a rule which assigns to every possible combination of votes (by any number of individuals) an alternative. We define the notion of asymptotic nonmanipulability for voting systems, and prove that every representable positionalist voting system is asymptotically nonmanipulable. Various aspects of manipulation of large voting schemes and several examples are also discussed.