Summability criterion: Difference between revisions
no edit summary
No edit summary |
No edit summary |
||
Line 139:
It's unknown whether it's possible to construct a Droop-proportional method that's summable in <math>O(\log(V) \cdot c^k \cdot s^n)</math> for constant <math>k</math> and <math>n</math>.
== Notes ==
Many voting methods that are summable to some degree can be manually summed in a harder way. For example, [[Score voting]] can be counted using a form of [[Pairwise counting]] that takes degree of preference into account.
Some voting methods can be counted like [[Approval voting]] when counting:
* Approval-style ballots (a ballot that maximally supports some candidates and doesn't support any other candidates),.
* More generally, the 1st choices of a ballot can be counted like Approval for any ballots that rank one (or possibly more) candidates 1st, but show some support for some other candidates, (This means the ballot's support for its non-1st choice candidates may be harder to count).
reducing the amount of work otherwise necessary to count them. For example, [[Condorcet methods]] can have this done using a certain implementation of the [[Negative vote-counting approach for pairwise counting]], or simply by using [[Pairwise counting#Counting first choices separately]].
== See also ==
| |||