Hostname: page-component-cb9f654ff-c75p9 Total loading time: 0 Render date: 2025-08-20T19:10:15.725Z Has data issue: false hasContentIssue false

Preferential Voting Concepts

Published online by Cambridge University Press:  28 July 2025

John S. Croucher*
Affiliation:
Macquarie University, Sydney, Australia

Extract

An interesting application of mathematics is that pertaining to the idea of preferential voting. By this we mean that if you don't get your first choices elected then you should still have some input into those who candidates who are. For example, suppose there are 20 candidates running for 5 positions. In this case it is assumed that you will rank all 20 candidates from 1 through 20 so that your 6th and later preferences get some weighting as well as the first five.

The ideas are illustrated by considering the elementary case in which three of six candidates are to be elected. In each example it assumed that the voters must rank the candidates in order of preference, with 1 being the first choice and 6 the last choice.

Information

Type
Articles
Copyright
Copyright © The Mathematical Association 1995

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

1. Farquarson, R., Theory of Voting, Yale University Press, New Haven (1969).Google Scholar