Summability criterion: Difference between revisions
Mathified n^2 in notes section, and removed the generalization of Simmons' color-proportional summability, as I'm not sure it's correct.
(Adding link to Equal Vote Coalition explanation of summability, and other minor copyediting) |
(Mathified n^2 in notes section, and removed the generalization of Simmons' color-proportional summability, as I'm not sure it's correct.) |
||
Line 155:
===Academic results===
[[Forest Simmons]] has constructed a color-proportional method that's summable in <math>O(\log(V) \cdot c)</math> for any number of seats.<ref name="RangeVoting.org 2007">{{cite web | title=answer to puzzle 15 | website=RangeVoting.org | date=2007-02-01 | url=https://rangevoting.org/PuzzQWEAns15.html | access-date=2020-02-11}}</ref>
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>.
Line 166:
===Number of data value types versus number of data values ===
Summability focuses to a large extent on the number of data value types, not just the amount of data overall that has to be captured. This can make a difference in certain cases; for example, the regular [[pairwise counting]] approach only requires
|