Difference between revisions of "Summability criterion"
(MCA) 

Line 1:  Line 1:  
+  The '''summability criterion''' is a criterion about the counting process of voting systems. Unlike most other voting system criteria, it does not relate to the end result, only to the process.  
+  
Each vote should map onto a summable array, where the summation operation is associative and commutative, and the winner should be determined from the array sum for all votes cast. An election method is ''kthorder summable'' if there exists a constant ''c'' such that in any election with ''n'' candidates, the required size of the array is at most ''cn<sup>k</sup>''. If there is no value of ''k'' for which the method is ''k''thorder summable, the method is ''nonsummable''.  Each vote should map onto a summable array, where the summation operation is associative and commutative, and the winner should be determined from the array sum for all votes cast. An election method is ''kthorder summable'' if there exists a constant ''c'' such that in any election with ''n'' candidates, the required size of the array is at most ''cn<sup>k</sup>''. If there is no value of ''k'' for which the method is ''k''thorder summable, the method is ''nonsummable''.  
Revision as of 11:56, 18 October 2010
The summability criterion is a criterion about the counting process of voting systems. Unlike most other voting system criteria, it does not relate to the end result, only to the process.
Each vote should map onto a summable array, where the summation operation is associative and commutative, and the winner should be determined from the array sum for all votes cast. An election method is kthorder summable if there exists a constant c such that in any election with n candidates, the required size of the array is at most cn^{k}. If there is no value of k for which the method is kthorder summable, the method is nonsummable.
Summable Methods
k=1  k=2  k=3  nonsummable 



Examples
In plurality voting, each vote is equivalent to a onedimensional array with a 1 in the element for the selected candidate, and a 0 for each of the other candidates. The sum of the arrays for all the votes cast is simply a list of vote counts for each candidate. Approval voting is the same as plurality voting except that more than one candidate can get a 1 in the array for each vote. Each of the selected or "approved" candidates gets a 1, and the others get a 0.
In Schulze, each vote is equivalent to a twodimensional array referred to as a pairwise matrix. If candidate A is ranked above candidate B, then the element in the A row and B column gets a 1, while the element in the B row and A column gets a 0. The pairwise matrices for all the votes are summed, and the winner is determined from the resulting pairwise matrix sum.
IRV does not comply with the summability criterion. In the IRV system, a count can be maintained of identical votes, but votes do not correspond to a summable array. The total possible number of unique votes grows factorially with the number of candidates.
Importance of summability
The summability criterion addresses implementation logistics. Election methods with lower summability levels are substantially easier to implement with integrity than methods with higher summability levels or methods that are nonsummable.
Suppose, for example, that the number of candidates is ten. Under firstorder summable methods like plurality or Approval voting, the votes at any level (precinct, ward, county, etc.) can be compressed into a list of ten numbers. For Schulze, a 10Ãƒâ€”10 matrix is needed. In an IRV system, however, the number of possible unique votes is over ten factoriala very large number. The larger the number of candidates, the more errorprone and less practical it becomes to maintain counts of each possible unique vote. Under IRV, therefore, every individual vote (rank list) must be available at a central location to determine the winner. In a major public election, that could be millions or even tens of millions of votes. The votes cannot be compressed by summing as in other election methods because votes may need to be transferred according to which candidates are eliminated in each round.
IRV therefore requires far more data transfer and storage than the other methods. Modern networking and computer technology can handle it, but that is beside the point. The biggest challenge in using computers for public elections will always be security and integrity. If many thousands of times more data needs to be transferred and stored, verification becomes more difficult and the potential for fraudulent tampering becomes substantially greater.
To illustrate this point, consider the verification of a vote tally for a national office. In a plurality election, each precinct verifies its vote count. This can be an open process where The counts for each precinct in a county can then be added to determine the county totals, and anyone with a calculator or computer can verify that the totals are correct. The same process is then repeated at the state level and the national level. If the votes are verified at the lowest (precinct) level, the numbers are available to anyone for independent verification, and election officials could never get away with "fudging" the numbers.
Recounts
In firstorder summable election systems, adding new ballots to the count (say, ballots that were found after the initial count, or late absentee ballots, or ballots that were initially ruled invalid) is as simple as "summing" the original result with the newlyfound ballots. Under nonsummable systems, though, finding new ballots means all ballots must be recounted. This is not a big problem for computer recounts, but manual recounts can be extremely timeconsuming and expensive.
Some parts of this article are derived with permission from text at http://electionmethods.org
This page uses Creative Commons Licensed content from Wikipedia (view authors). 