Syntatic and Semantic Taxonomy of Preferential Voting Methods

  • Sung-Hyuk ChaEmail author
  • Yoo Jung An
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 247)


Preferential voting where the voters rank candidates in order of preference plays an important role in many decision making problems and have been studied intensively. Yet there are too many variations and many popular methods are promulgated differently in different regions. Hence, some iconic conventional methods are reviewed for syntactic patterns and categorized. A nomenclature for these voting methods is suggested to reveal their syntactic patterns. Over a thousand of voting methods are devised from the conventional procedural patterns. Over 60 representative voting methods are used to reveal their semantic relationship in the form of hierarchical clustering tree. All preferential voting methods perform significantly different from the simplest plurality method.


Decision Hierarchical clustering Nomenclature Preferential voting Taxonomy Voting 


  1. 1.
    Samuel M III (1988) Making multicandidate elections more democratic. Princeton University Press, PrincetonGoogle Scholar
  2. 2.
    Levin J, Nalebuff B (1995) An introduction to vote-counting schemes. J Econ Perspect 9(I):3–26 WinterGoogle Scholar
  3. 3.
    Taylor AD, Pacelli AM (1995) Mathematics and politics: strategy, voting, power and proof. Springer, BerlinCrossRefzbMATHGoogle Scholar
  4. 4.
    Ho TK, Hull JJ, Srihari SN (1984) Decision combination in multiple classifier systems. IEEE Trans J PAMI 16(I):66–75Google Scholar
  5. 5.
    Duda RO, Hart PE, Stork DG (2001) Pattern classification, 2nd edn. Wiley, LondonzbMATHGoogle Scholar
  6. 6.
    Faliszewski P, Hemaspaandra E, Hemaspaandra LA, Rothe J (2009) Llull and Copeland voting computationally resist bribery and constructive control. J Artif Intell Res 35:275–341MathSciNetzbMATHGoogle Scholar
  7. 7.
    de Borda JC (1781) Mémoire sur les Élections au Scrutin. Histoire del l’Académie Royale des Sciences, ParisGoogle Scholar
  8. 8.
    de Condorcet M (1785) Essay on the application of mathematics to the theory of decision-making. ParisGoogle Scholar
  9. 9.
    Cha S, An YJ (2012) Taxonomy and nomenclature of preferential voting methods, Lecture notes in engineering and computer science. In: Proceedings of the world congress on engineering and computer science, WCECS 2012, San Francisco, USA, pp 173–178, 24–26 Oct 2012Google Scholar
  10. 10.
    Black D (1953) The theory of committees and elections. Cambridge University Press, LondonGoogle Scholar
  11. 11.
    Bartholdi J III, Tovey CA, Trick MA (1989) Voting schemes for which it can be difficult to tell who won the election. Soc Choice Welfare 6(2):157–165MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Reilly B (2003) The global spread of preferential voting: Australian institutional imperialism. Aust J Political Sci 39(2):253–266CrossRefGoogle Scholar
  13. 13.
    Coombs C (1964) A theory of data. Wiley, New YorkGoogle Scholar
  14. 14.
    Nanson EJ (1882) Methods of election. Trans Proc R Soc Victoria 19:197–240Google Scholar
  15. 15.
    Baldwin JM (1926) The technique of the Nanson preferential majority system of election. Proc R Soc Victoria 39:42–52Google Scholar
  16. 16.
    Copeland AH (1951) A ‘reasonable’ social welfare function. Presented at the seminar on mathematics in social sciences, University of MichiganGoogle Scholar
  17. 17.
    LeGrand R (2012) Descriptions of ranked-ballot voting methods. as of June 2012

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Computer Science DepartmentPace UniversityNew YorkUSA
  2. 2.Division of Engineering Technologies and Computer SciencesEssex County CollegeNewarkUSA

Personalised recommendations