Borda's social choice method and Condorcet's social choice method are shown to satisfy different monotonicities and it is shown that it is impossible for any social choice method to satisfy them both. Results of a Monte Carlo simulation are presented which estimate the probability of each of the following social choice methods being manipulable: plurality (first past the post), Borda count, instant runoff, Kemeny-Young, Schulze, and majority Borda. The Kemeny-Young and Schulze methods exhibit the strongest resistance to random manipulability.
Download count: 0
- Partial requirement for: Ph.D., Arizona State University, 2010Note typethesis
- Includes bibliographical references (p. 73-74)Note typebibliography
- Field of study: Mathematics