[EM] A more Condorcet-like party list PR method

[Kristofer Munsterhjelm]

On 07/06/2013 02:26 PM, Kristofer Munsterhjelm wrote:

> The method should be weakly summable (i.e. when the number of parties
> are kept constant). For each cell in the matrix, do the elimination
> first, then store the counts for each party. These counts can be summed
> up between districts, so if n is the number of parties, you have (2^n)^2
> cells, each of which stores n numbers in the worst case. And since n is
> a constant, so is 2^n.

Replying to myself with an oops, here. By "weakly summable", I usually 
mean "summable with the number of seats held constant, number of 
candidates permitted to vary". If by "candidates" we mean parties, the 
Condorcet-like party list method fails this. Instead, it has a peculiar 
form of kinda-summability: with the number of candidates (parties) held 
constant but seats left to vary, it is summable.