![]() |
|
||||
|
|||||
Meek’s MethodNEW! Computer Journal article that describes Meek's method of counting STV votes:
The following points explain in what ways Meek’s method is different to other forms of STV: Vote transfer Votes are transferred to the next preference of the voter in the exact order indicated by the voter on the voting document unless the candidate has already been excluded. Value of surpluses The total value of a surplus or surpluses is shared in due proportion across both transferable and non-transferable voting documents. Sharing of votes If a candidate is elected later in the count, or an elected candidate receives further votes, the surplus to be transferred is shared across all voting documents credited to that candidate in due proportions, not just across the voting documents that gave immediate rise to the surplus. Recalculation of quota As votes become non-transferable (eg, because the number of preferences recorded in the voting document is exhausted), the quota is recalculated to reflect the smaller total of votes remaining active. The new quota then applies to already elected candidates as well as others, giving them further surpluses to redistribute. Need for computer technology Because the procedure required to conduct a count using Meek's method of counting votes requires a candidate to be assigned a scaling factor (a keep value) representing the proportion of each vote that will actually be credited to each candidate, the number of calculations involved requires the count to be conducted using computer technology rather than by means of a manual count. General description of process used to conduct count at election under system of Single Transferable Voting using Meek's method of counting votes Interpretation In the following clauses, unless the context otherwise requires:
Election to fill mayoral or single member vacancy
Equal votes If, on any count, 2 or more candidates have an equal number of votes and 1 of them has to be excluded, the electoral officer determines which candidate had the fewest votes the first time the candidates' totals were different and excludes the candidate with the lowest total votes. Ties If the candidates had an equal number of votes at all stages of the count, a random (or pseudo-random) process is used to choose which candidate is excluded. Multi-member vacancies Before commencing the official count, the electoral officer rejects as informal any voting document on which the voter's first preference is not able to be determined, or on which a unique first preference vote is recorded for a candidate who is no longer available for election. The number of valid voting documents is determined. Formulas Quota The quota is calculated (to 9 decimal digits after the point with any remainder being disregarded) in accordance with the following formula:
where: q is the quota v is the total number of valid votes, less the number of non-transferable votes n is the total number of members to be elected. Keep value When a candidate's votes exceed the quota, a new keep value is calculated in accordance with the following formula:
where: k is the candidate's new keep value ck is the candidate's current keep value q is the current quota cv is the candidate's current votes. In calculating the keep value under subclause (1), both the multiplication and the division are taken to 9 decimal digits after the point and, in each case, rounded up if not exact. General procedure
Counting of votes The first iteration
Second and subsequent iterations
Equal votes If, on any count, 2 or more candidates have an equal number of votes and 1 of them has to be excluded, the electoral officer determines which candidate had the fewest votes the first time the candidates' totals were different and excludes the candidate with the lowest total votes. Ties If the candidates had an equal number of votes at all stages of the count, a random (or pseudo-random) process is used to choose which candidate is excluded. Algorithm used to calculate Meek’s method The following paragraphs give some further detail on the algorithm used to calculate Meek’s method and how computer programs using the algorithm will be certified. Algorithm and article Meek's method of counting votes requires the use of Algorithm 123 in the form described in an article in The Computer Journal (UK), Vol 30, No 3, 1987, pp 277-81 (the article). (A discussion of the mathematical equations that prove the existence and uniqueness of the method is set out in the article). Authority for modifications Algorithm 123 (in the form described in the article) and the formulas and procedures proposed in the article may, for the purposes of designing a computer program to implement Meek's method of counting votes, incorporate the following modifications:
(b) any other modification authorised by regulations made under this Act. Duties of programmers and certifiers Duties of programmers Every person responsible for the design of a computer program intended to implement Meek's method of counting votes must take all reasonable steps to ensure that the program produces outcomes that are consistent with Algorithm 123 in the form described in the article and any authorised modifications. Duties of certifiers A computer program may not be used at any election or poll under this Act for the purpose of implementing Meek's method of counting votes unless a certifier appointed for the purpose by the Secretary for Local Government has first certified that the program produces outcomes that are consistent with Algorithm 123 (in the form described in the article) and any authorized modifications.
|
|
|
||||||||
|
|
Last updated: 20/04/2006 |
|||||||