Simulating STV Hand-Counting by Computers Considered Harmful: A.C.T.

详细信息    查看全文

• 刊名：Lecture Notes in Computer Science
• 出版年：2017
• 出版时间：2017
• 年：2017
• 卷：10141
• 期：1
• 页码：144-163
• 丛书名：Electronic Voting
• ISBN：978-3-319-52240-1
• 卷排序：10141

文摘

We outline various ways in which the single transferable vote-counting (STV) algorithm used by the Australian Capital Territory (ACT) differs from the basic STV algorithm as well-known from social choice theory. Most of these differences were instituted to make it easier and faster to determine the result of counting around 300,000 ballots by hand. We give small examples to show how such “simplifications” can lead to counter-intuitive results. We also argue that these “simplifications” significantly complicate computer implementation and general understanding of the counting procedure, especially in a mathematical sense. We then demonstrate the strange effects of these “simplifications” in real-world computer counted election results which were published by ACT Elections. It is imperative that electoral commissions begin the legislative processes required to replace their existing “simplified” STV with “unsimplified” STV.