Voting schemes for which it can be difficult to tell who won the election
- 1 April 1989
- journal article
- research article
- Published by Springer Nature in Social Choice and Welfare
- Vol. 6 (2) , 157-165
- https://doi.org/10.1007/bf00303169
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The computational difficulty of manipulating an electionSocial Choice and Welfare, 1989
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- Integer Programming with a Fixed Number of VariablesMathematics of Operations Research, 1983
- Voting Procedures: A Summary AnalysisBritish Journal of Political Science, 1983
- The median procedure in cluster analysis and social choice theoryMathematical Social Sciences, 1981
- Condorcet Social Choice FunctionsSIAM Journal on Applied Mathematics, 1977
- The Choice of Voting SystemsScientific American, 1976
- Paradoxes of VotingAmerican Political Science Review, 1974
- Voting Anomalies, the Number of Voters, and the Number of AlternativesEconometrica, 1974
- The Voting ProblemThe American Mathematical Monthly, 1959