Summability criterion: Difference between revisions

Content added Content deleted

Inline

Revision as of 04:47, 23 March 2005 (view source) 12.73.132.31 (talk) (→‎Summable Methods) ← Older edit		Revision as of 07:19, 27 March 2005 (view source) 128.194.22.111 (talk) (terminology to reflect Russ' suggestion on the mailing list) Newer edit →
Line 1:		Line 1:
	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 ''k-summable'' ~~(or "passes the k-Summability Criterion")~~ if there exists a constant c such that in any election with n candidates, the required size of the "array" is at most ~~c*n^~~k. ~~An election method is "non-summable" if~~ there is no k for which it is k-summable.		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 ''kth-order 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''th-order summable, the method is ''non-summable''.

	== Summable Methods ==		== Summable Methods ==