Manipulability of Voting Schemes
4 Pages Posted: 13 Apr 2008 Last revised: 22 Nov 2016
Date Written: March 1, 2008
In the article it is proved that manipulability of a voting procedure depends on reliable information on the expected outcome of a voting rather than on violation of the Arrow’s conditions in disproof of Gibbard-Satterthwaite’s theorem.
Keywords: manipulability, voting, strategy-proofness, reliable information
JEL Classification: D71
Suggested Citation: Suggested Citation