Summability criterion: Difference between revisions
m
→Requirements: fixed a spelling error
(→Compliance: More copyediting) |
m (→Requirements: fixed a spelling error) |
||
Line 5:
== Compliance ==
Back in 2009, [[English Wikipedia]] stated that the criterion was stated as follows:<ref>An article titled "[[wikipedia:Summability criterion|Summability criterion]]" was deleted from [[English Wikipedia]] in 2009.<nowiki><ref></nowiki>[[English Wikipedia]] AfD for "Summability Criterion": https://en.wikipedia.org/wiki/Wikipedia:Articles_for_deletion/Summability_criterion
Before the page was deleted from Wikipedia, it was copied to [[Electowiki]]. Those with the correct permissions can see the edit history on English Wikipedia.</ref> <blockquote><em>Each vote should be able to be mapped onto a summable array, such that its size at most grows polynomially with respect to the amount of candidates, the summation operation is associative and commutative and the winner could be determined from the array sum for all votes cast alone.</em><ref>Note that this blockquote was copied to [[electowiki]] before it was deleted from [[English Wikipedia]]. There were other changes may have been made after the article was copied from [[wikipedia:Summability criterion]] to [[Summability criterion (Wikipedia version)]]. Please see the edit histories for each page to determine who authored the passage you are interested in.</ref></blockquote>Here at [[electowiki]], we believe the following methods comply with the summability criterion:
Line 23 ⟶ 22:
== Requirements ==
Informally speaking, the amount of data that has to be transmitted from the precincts should be less than the amount of data on the ballots themselves. In other
=== Mathematical requirements ===
| |||