Talk:Summability criterion: Difference between revisions

From electowiki
Content added Content deleted
imported>KVenzke
No edit summary
No edit summary
Line 2: Line 2:


I couldn't make it work. DSC needs 2^n numbers. That's still much more feasible than IRV, though. -Kevin Venzke
I couldn't make it work. DSC needs 2^n numbers. That's still much more feasible than IRV, though. -Kevin Venzke


The article says "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." Is this really entirely accurate? In each round the candidate to be eliminated is determined from the number of votes placing each uneliminated candidate first in the set of uneliminated candidates. This means (assuming tie-break rules that don't create added complication) that recording, for every set of 2 or more candidates, the number of votes giving top place within the set to each candidate in the set, will suffice. This is a summable array of n(2^(n-1)-1) numbers, still failing the criterion but enough to make the statement that "the votes cannot be compressed by summing" incorrect. Am I missing something? - DPJ

Revision as of 06:47, 30 June 2005

Is DSC really second-order summable, or is this an error? If it's not an error, then how do you construct a cn² summation array?

I couldn't make it work. DSC needs 2^n numbers. That's still much more feasible than IRV, though. -Kevin Venzke


The article says "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." Is this really entirely accurate? In each round the candidate to be eliminated is determined from the number of votes placing each uneliminated candidate first in the set of uneliminated candidates. This means (assuming tie-break rules that don't create added complication) that recording, for every set of 2 or more candidates, the number of votes giving top place within the set to each candidate in the set, will suffice. This is a summable array of n(2^(n-1)-1) numbers, still failing the criterion but enough to make the statement that "the votes cannot be compressed by summing" incorrect. Am I missing something? - DPJ