Proportionality for Solid Coalitions

From Electowiki
Jump to navigation Jump to search

Proportionality for Solid Coalitions (PSC) is a criterion for proportional methods requiring that sufficiently-sized groups of voters (solid coalitions) always elect a proportional number of candidates from their set of mutually most-preferred candidates. It is the main conceptualization of Proportional Representation generally used throughout the world (Party List and STV pass versions of it.) The two main types of PSC are k-PSC (aka. Hare-PSC, a condition requiring a solid coalition comprising k Hare quotas to be always elect at least k most-preferred candidates) and k+1-PSC (aka. Droop-PSC, which is the same as Hare-PSC but holding for Droop quotas instead).

Any voting method that collects enough information to distinguish solid coalitions (generally scored or ranked methods, since preferences can be inferred from their ballots) can be forced to be PSC-compliant by first electing the proportionally correct number of candidates from each solid coalition before doing anything else.

Cardinal PR methods generally don't pass PSC, though they pass weaker, related versions relating to Hare quotas of voters being able to force the proportionally correct number of their most-preferred candidates to win through strategic voting. In general, any method that passes such weaker versions of PSC is considered to be at least semi-proportional.

Examples

5-winner example, Hare quota 50 (example done using scored ballots):

Number Ballots
10 A1:10 A2:7 A3:7 A4:7 A5:7 B1:1 C1:0 D1:0 E1:0 F1:0
10 A1:7 A2:10 A3:7 A4:7 A5:7 B1:0 C1:1 D1:0 E1:0 F1:0
10 A1:7 A2:7 A3:10 A4:7 A5:7 B1:0 C1:0 D1:1 E1:0 F1:0
10 A1:7 A2:7 A3:7 A4:10 A5:7 B1:0 C1:0 D1:0 E1:1 F1:0
10 A1:7 A2:7 A3:7 A4:7 A5:10 B1:0 C1:0 D1:0 E1:0 F1:0
40 A1:2 A2:0 A3:0 A4:0 A5:1 B1:10 C1:0 D1:0 E1:0 F1:0
40 A1:0 A2:2 A3:0 A4:0 A5:1 B1:0 C1:10 D1:0 E1:0 F1:0
40 A1:0 A2:0 A3:2 A4:0 A5:1 B1:0 C1:0 D1:10 E1:0 F1:0
40 A1:0 A2:0 A3:0 A4:2 A5:1 B1:0 C1:0 D1:0 E1:10 F1:0
40 A1:0 A2:0 A3:0 A4:0 A5:0 B1:0 C1:0 D1:0 E1:0 F1:10

Looking at the top 5 lines, 50 voters, a Hare quota, mutually most prefer the set of candidates (A1-5) over all other candidates, so Hare-PSC requires at least one of (A1-5) must win. (Note that Sequential Monroe voting fails Hare-PSC in this example. However, one could forcibly make SMV do so by declaring that the candidate with the highest Monroe score within the set (A1-5) must win the first seat, for example.) [1]

25 A2>A1

26 B1>

Generalised solid coalitions

The Expanding Approvals Rule passes a stricter PR axiom than PSC:

Definition 5 (Generalised solid coalition) A set of voters N′ is a generalised solid coalition for a set of candidates C′ if every voter in N′ weakly prefers every candidate in C′ at least as high as every candidate in C\C′. That is, for all i ∈ N′ and for any c′ ∈ C′

∀c ∈ C\C′ c′ i c. We note that under strict preferences, a generalised solid coalition is equivalent

to solid coalition. Let c(i, j) denotes voter i’s j-th most preferred candidate. In case the voter’s preference has indifferences, we use lexicographic tie-breaking to identify the candidate in the j-th position.

Definition 6 (Generalised q-PSC) Let q ∈ (n/(k + 1), n/k]. A committee W satisfies generalised q-PSC if for all generalised solid coalitions N′ supporting candidate subset C′ with size |N′| ≥ ℓq, there exists a set C′′ ⊆ W with size at least min{ℓ, |C′|} such that for all c′′ ∈ C′′

∃i ∈ N′ : c′′ i c(i,|C′ |). The idea behind generalised q-PSC is identical to that of q-PSC and in fact generalised q-PSC is equivalent to q-PSC under linear preferences. Note that in the definition above, a voter i in the solid coalition of voters N′ does not demand membership of candidates from the solidly supported subset C′ but of any candidate that is at least as preferred as a least preferred candidate in C′. Generalised weak q-PSC is a natural weakening of generalised q-PSC in which we require that C′ is of size at most ℓ.

Definition 7 (Generalised weak q-PSC) Let q ∈ (n/(k + 1), n/k]. A committee W satisfies weak generalised q-PSC if for every positive integer ℓ, and every generalised solid coalition N′ supporting a candidate subset C′

|C′| ≤ ℓ with size |N′| ≥ ℓq, there

exists a set C′′ ⊆ W with size at least min{ℓ, |C′|} such that for all c′′ ∈ C′′ ∃i ∈ N′

c′′ i c(i,|C′ |).[2]


Notes

Droop-PSC implies Hare-PSC, since a Hare quota is simply a large Droop quota, but the same doesn't hold the other way around. Hare-PSC is equivalent to the unanimity criterion and Droop-PSC to the mutual majority criterion in the single-winner case. Note that this means cardinal PR methods can only pass Hare-PSC and not Droop-PSC in order to reduce to cardinal methods that fail the mutual majority criterion in the single-winner case, which is most of them.

Note that PSC doesn't hold if some voters in a coalition back out-of-coalition candidates i.e. 1-winner example with Droop quota of 51:

26 A>B

25 B

49 C

STV would elect C here. Yet if A hadn't run, then B would've been 51 voter's 1st choice, so a Droop solid coalition would've been backing them, and since STV passes Droop-PSC, B would've guaranteeably won.

One could also consider various extensions of the solid coalition idea, in part to address examples like the above one; 5-winner example:

; 5-winner example:

9 A>F>G>H>I>J

9 B>F>G>H>I>J

9 C>F>G>H>I>J

9 D>F>G>H>I>J

9 E>F>G>H>I>J

8 K

7 L

Arguably there is some kind of coalition of 45 voters backing candidates A through J here, and since the largest opposing coalition is 8 voters, D'Hondt would say that the 45-voter coalition ought to win all 5 seats. At that point, one could eliminate all candidates outside the 45-voter coalition (K and L) at which point A through E all are a Hare quota's 1st choice and must all win. This sort of thinking is generally what Condorcet PR methods such as Schulze STV do.