# Consistency criterion

A voting system is consistent if, when the electorate is divided arbitrarily into two (or more) parts and separate elections in each part result in the same choice being selected, an election of the entire electorate also selects that alternative. Smith[1] calls this property separability and Woodall[2] calls it convexity.

It has been proven a ranked voting system is consistent if and only if it is a positional voting system.[3][need quotation to verify] Borda count is an example of this.

The failure of the consistency criterion can be seen as an example of Simpson's paradox.

## Examples

### Copeland

Main article: Copeland's method

This example shows that Copeland's method violates the Consistency criterion. Assume five candidates A, B, C, D and E with 27 voters with the following preferences:

# of voters Preferences
3 A > D > B > E > C
2 A > D > E > C > B
3 B > A > C > D > E
3 C > D > B > E > A
3 E > C > B > A > D
3 A > D > C > E > B
1 A > D > E > B > C
3 B > D > C > E > A
3 C > A > B > D > E
3 E > B > C > A > D

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

#### First group of voters

In the following the Copeland winner for the first group of voters is determined.

# of voters Preferences
3 A > D > B > E > C
2 A > D > E > C > B
3 B > A > C > D > E
3 C > D > B > E > A
3 E > C > B > A > D

The results would be tabulated as follows:

 X A B C D E Y A [X] 9 [Y] 5 [X] 6 [Y] 8 [X] 3 [Y] 11 [X] 6 [Y] 8 B [X] 5 [Y] 9 [X] 8 [Y] 6 [X] 8 [Y] 6 [X] 5 [Y] 9 C [X] 8 [Y] 6 [X] 6 [Y] 8 [X] 5 [Y] 9 [X] 8 [Y] 6 D [X] 11 [Y] 3 [X] 6 [Y] 8 [X] 9 [Y] 5 [X] 3 [Y] 11 E [X] 8 [Y] 6 [X] 9 [Y] 5 [X] 6 [Y] 8 [X] 11 [Y] 3 Pairwise election results (won-tied-lost): 3-0-1 2-0-2 2-0-2 2-0-2 1-0-3
• [X] indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
• [Y] indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

Result: With the votes of the first group of voters, A can defeat three of the four opponents, whereas no other candidate wins against more than two opponents. Thus, A is elected Copeland winner by the first group of voters.

#### Second group of voters

Now, the Copeland winner for the second group of voters is determined.

# of voters Preferences
3 A > D > C > E > B
1 A > D > E > B > C
3 B > D > C > E > A
3 C > A > B > D > E
3 E > B > C > A > D

The results would be tabulated as follows:

 X A B C D E Y A [X] 6 [Y] 7 [X] 9 [Y] 4 [X] 3 [Y] 10 [X] 6 [Y] 7 B [X] 7 [Y] 6 [X] 6 [Y] 7 [X] 4 [Y] 9 [X] 7 [Y] 6 C [X] 4 [Y] 9 [X] 7 [Y] 6 [X] 7 [Y] 6 [X] 4 [Y] 9 D [X] 10 [Y] 3 [X] 9 [Y] 4 [X] 6 [Y] 7 [X] 3 [Y] 10 E [X] 7 [Y] 6 [X] 6 [Y] 7 [X] 9 [Y] 4 [X] 10 [Y] 3 Pairwise election results (won-tied-lost): 3-0-1 2-0-2 2-0-2 2-0-2 1-0-3

Result: Taking only the votes of the second group in account, again, A can defeat three of the four opponents, whereas no other candidate wins against more than two opponents. Thus, A is elected Copeland winner by the second group of voters.

#### All voters

Finally, the Copeland winner of the complete set of voters is determined.

# of voters Preferences
3 A > D > B > E > C
3 A > D > C > E > B
1 A > D > E > B > C
2 A > D > E > C > B
3 B > A > C > D > E
3 B > D > C > E > A
3 C > A > B > D > E
3 C > D > B > E > A
3 E > B > C > A > D
3 E > C > B > A > D

The results would be tabulated as follows:

 X A B C D E Y A [X] 15 [Y] 12 [X] 15 [Y] 12 [X] 6 [Y] 21 [X] 12 [Y] 15 B [X] 12 [Y] 15 [X] 14 [Y] 13 [X] 12 [Y] 15 [X] 12 [Y] 15 C [X] 12 [Y] 15 [X] 13 [Y] 14 [X] 12 [Y] 15 [X] 12 [Y] 15 D [X] 21 [Y] 6 [X] 15 [Y] 12 [X] 15 [Y] 12 [X] 6 [Y] 21 E [X] 15 [Y] 12 [X] 15 [Y] 12 [X] 15 [Y] 12 [X] 21 [Y] 6 Pairwise election results (won-tied-lost): 2-0-2 3-0-1 4-0-0 1-0-3 0-0-4

Result: C is the Condorcet winner, thus Copeland chooses C as winner.

#### Conclusion

A is the Copeland winner within the first group of voters and also within the second group of voters. However, both groups combined elect C as the Copeland winner. Thus, Copeland fails the Consistency criterion.

### Instant-runoff voting

Main article: Instant-runoff voting

This example shows that Instant-runoff voting violates the Consistency criterion. Assume three candidates A, B and C and 23 voters with the following preferences:

# of voters Preferences
4 A > B > C
2 B > A > C
4 C > B > A
4 A > B > C
6 B > A > C
3 C > A > B

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

#### First group of voters

In the following the instant-runoff winner for the first group of voters is determined.

# of voters Preferences
4 A > B > C
2 B > A > C
4 C > B > A

B has only 2 votes and is eliminated first. Its votes are transferred to A. Now, A has 6 votes and wins against C with 4 votes.

Candidate
1st 2nd
A 4 6
B 2
C 4 4

Result: A wins against C, after B has been eliminated.

#### Second group of voters

Now, the instant-runoff winner for the second group of voters is determined.

# of voters Preferences
4 A > B > C
6 B > A > C
3 C > A > B

C has the least votes count of 3 and is eliminated. A benefits from that, gathering all the votes from C. Now, with 7 votes A wins against B with 6 votes.

Candidate
1st 2nd
A 4 7
B 6 6
C 3

Result: A wins against B, after C has been eliminated.

#### All voters

Finally, the instant runoff winner of the complete set of voters is determined.

# of voters Preferences
8 A > B > C
8 B > A > C
3 C > A > B
4 C > B > A

C has the least first preferences and so is eliminated first, its votes are split: 4 are transferred to B and 3 to A. Thus, B wins with 12 votes against 11 votes of A.

Candidate
1st 2nd
A 8 11
B 8 12
C 7

Result: B wins against A, after C is eliminated.

#### Conclusion

A is the instant-runoff winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the instant-runoff winner. Thus, instant-runoff voting fails the Consistency criterion.

### Kemeny–Young method

Main article: Kemeny–Young method

This example shows that the Kemeny–Young method violates the Consistency criterion. Assume three candidates A, B and C and 38 voters with the following preferences:

# of voters Preferences
7 A > B > C
6 B > C > A
3 C > A > B
8 A > C > B
7 B > A > C
7 C > B > A

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

#### First group of voters

In the following the Kemeny-Young winner for the first group of voters is determined.

# of voters Preferences
7 A > B > C
6 B > C > A
3 C > A > B

The Kemeny–Young method arranges the pairwise comparison counts in the following tally table:

All possible pairs
of choice names
Number of votes with indicated preference
Prefer X over Y Equal preference Prefer Y over X
X = A Y = B 10 0 6
X = A Y = C 7 0 9
X = B Y = C 13 0 3

The ranking scores of all possible rankings are:

Preferences 1. vs 2. 1. vs 3. 2. vs 3. Total
A > B > C 10 7 13 30
A > C > B 7 10 3 20
B > A > C 6 13 7 26
B > C > A 13 6 9 28
C > A > B 9 3 10 22
C > B > A 3 9 6 18

Result: The ranking A > B > C has the highest ranking score. Thus, A wins ahead of B and C.

#### Second group of voters

Now, the Kemeny-Young winner for the second group of voters is determined.

# of voters Preferences
8 A > C > B
7 B > A > C
7 C > B > A

The Kemeny–Young method arranges the pairwise comparison counts in the following tally table:

All possible pairs
of choice names
Number of votes with indicated preference
Prefer X over Y Equal preference Prefer Y over X
X = A Y = B 8 0 14
X = A Y = C 15 0 7
X = B Y = C 7 0 15

The ranking scores of all possible rankings are:

Preferences 1. vs 2. 1. vs 3. 2. vs 3. Total
A > B > C 8 15 7 30
A > C > B 15 8 15 38
B > A > C 14 7 15 36
B > C > A 7 14 7 28
C > A > B 7 15 8 30
C > B > A 15 7 14 36

Result: The ranking A > C > B has the highest ranking score. Hence, A wins ahead of C and B.

#### All voters

Finally, the Kemeny-Young winner of the complete set of voters is determined.

# of voters Preferences
7 A > B > C
8 A > C > B
7 B > A > C
6 B > C > A
3 C > A > B
7 C > B > A

The Kemeny–Young method arranges the pairwise comparison counts in the following tally table:

All possible pairs
of choice names
Number of votes with indicated preference
Prefer X over Y Equal preference Prefer Y over X
X = A Y = B 18 0 20
X = A Y = C 22 0 16
X = B Y = C 20 0 18

The ranking scores of all possible rankings are:

Preferences 1. vs 2. 1. vs 3. 2. vs 3. Total
A > B > C 18 22 20 60
A > C > B 22 18 18 58
B > A > C 20 20 22 62
B > C > A 20 20 16 56
C > A > B 16 18 18 52
C > B > A 18 16 20 54

Result: The ranking B > A > C has the highest ranking score. So, B wins ahead of A and C.

#### Conclusion

A is the Kemeny-Young winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the Kemeny-Young winner. Thus, the Kemeny–Young method fails the Consistency criterion.

#### Ranking consistency

The Kemeny-Young method satisfies ranking consistency, that is if the electorate is divided arbitrarily into two parts and separate elections in each part result in the same ranking being selected, an election of the entire electorate also selects that ranking.

##### Informal proof

The Kemeny-Young score of a ranking $\mathcal{R}$ is computed by summing up the number of pairwise comparisons on each ballot that match the ranking $\mathcal{R}$. Thus, the Kemeny-Young score $s_V(\mathcal{R})$ for an electorate $V$ can be computed by separating the electorate into disjoint subsets $V = V_1 \cup V_2$ (with $V_1 \cap V_2 = \emptyset$), computing the Kemeny-Young scores for these subsets and adding it up:

$(I) \quad s_V(\mathcal{R}) = s_{V_1}(\mathcal{R}) + s_{V_2}(\mathcal{R})$.

Now, consider an election with electorate $V$. The premise of the consistency criterion is to divide the electorate arbitrarily into two parts $V = V_1 \cup V_2$, and in each part the same ranking $\mathcal{R}$ is selected. This means, that the Kemeny-Young score for the ranking $\mathcal{R}$ in each electorate is bigger than for every other ranking $\mathcal{R}'$:

$(II) \quad \forall \mathcal{R}' : s_{V_1}(\mathcal{R}) > s_{V_1}(\mathcal{R}')$ and
$(III) \quad \forall \mathcal{R}' : s_{V_2}(\mathcal{R}) > s_{V_2}(\mathcal{R}')$.

Now, it has to be shown, that the Kemeny-Young score of the ranking $\mathcal{R}$ in the entire electorate is bigger than the Kemeny-Young score of every other ranking $\mathcal{R}'$:

$s_V(\mathcal{R}) \stackrel{(I)}{=} s_{V_1}(\mathcal{R}) + s_{V_2}(\mathcal{R}) \stackrel{(II)}{>} s_{V_1}(\mathcal{R}') + s_{V_2}(\mathcal{R}) \stackrel{(III)}{>} s_{V_1}(\mathcal{R}') + s_{V_2}(\mathcal{R}') \stackrel{(I)}{=} s_V(\mathcal{R}') \quad q.e.d.$

Thus, the Kemeny-Young method is consistent respective rankings.

### Majority Judgment

Main article: Majority Judgment

This example shows that Majority Judgment violates the Consistency criterion. Assume two candidates A and B and 10 voters with the following ratings:

Candidates/
# of voters
A B
3 Excellent Fair
2 Poor Fair
3 Fair Poor
2 Poor Fair

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

#### First group of voters

In the following the Majority judgment winner for the first group of voters is determined.

Candidates/
# of voters
A B
3 Excellent Fair
2 Poor Fair

The sorted ratings would be as follows:

Candidate
 ↓ Median point
A
B

 Excellent Good Fair Poor

Result: With the votes of the first group of voters, A has the median rating of "Excellent" and B has the median rating of "Fair". Thus, A is elected Majority Judgment winner by the first group of voters.

#### Second group of voters

Now, the Majority Judgment winner for the second group of voters is determined.

Candidates/
# of voters
A B
3 Fair Poor
2 Poor Fair

The sorted ratings would be as follows:

Candidate
 ↓ Median point
A
B

 Excellent Good Fair Poor

Result: Taking only the votes of the second group in account, A has the median rating of "Fair" and B the median rating of "Poor". Thus, A is elected Majority Judgment winner by the second group of voters.

#### All voters

Finally, the Majority Judgment winner of the complete set of voters is determined.

Candidates/
# of voters
A B
3 Excellent Fair
3 Fair Poor
4 Poor Fair

The sorted ratings would be as follows:

Candidate
 ↓ Median point
A
B

 Excellent Good Fair Poor

The median ratings for A and B are both "Fair". Since there is a tie, "Fair" ratings are removed from both, until their medians become different. After removing 20% "Fair" ratings from the votes of each, the sorted ratings are now:

Candidate
 ↓ Median point
A
B

Result: Now, the median rating of A is "Poor" and the median rating of B is "Fair". Thus, B is elected Majority Judgment winner.

#### Conclusion

A is the Majority Judgment winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the Majority Judgment winner. Thus, Majority Judgment fails the Consistency criterion.

### Minimax

Main article: Minimax Condorcet

This example shows that the Minimax method violates the Consistency criterion. Assume four candidates A, B, C and D with 43 voters with the following preferences:

# of voters Preferences
1 A > B > C > D
6 A > D > B > C
5 B > C > D > A
6 C > D > B > A
8 A > B > D > C
2 A > D > C > B
9 C > B > D > A
6 D > C > B > A

Since all preferences are strict rankings (no equals are present), all three Minimax methods (winning votes, margins and pairwise opposite) elect the same winners.

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

#### First group of voters

In the following the Minimax winner for the first group of voters is determined.

# of voters Preferences
1 A > B > C > D
6 A > D > B > C
5 B > C > D > A
6 C > D > B > A

The results would be tabulated as follows:

 X A B C D Y A [X] 11 [Y] 7 [X] 11 [Y] 7 [X] 11 [Y] 7 B [X] 7 [Y] 11 [X] 6 [Y] 12 [X] 12 [Y] 6 C [X] 7 [Y] 11 [X] 12 [Y] 6 [X] 6 [Y] 12 D [X] 7 [Y] 11 [X] 6 [Y] 12 [X] 12 [Y] 6 Pairwise election results (won-tied-lost): 0-0-3 2-0-1 2-0-1 2-0-1 worst pairwise defeat (winning votes): 11 12 12 12 worst pairwise defeat (margins): 4 6 6 6 worst pairwise opposition: 11 12 12 12
• [X] indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
• [Y] indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

Result: The candidates B, C and D form a cycle with clear defeats. A benefits from that since it loses relatively closely against all three and therefore A's biggest defeat is the closest of all candidates. Thus, A is elected Minimax winner by the first group of voters.

#### Second group of voters

Now, the Minimax winner for the second group of voters is determined.

# of voters Preferences
8 A > B > D > C
2 A > D > C > B
9 C > B > D > A
6 D > C > B > A

The results would be tabulated as follows:

 X A B C D Y A [X] 15 [Y] 10 [X] 15 [Y] 10 [X] 15 [Y] 10 B [X] 10 [Y] 15 [X] 17 [Y] 8 [X] 8 [Y] 17 C [X] 10 [Y] 15 [X] 8 [Y] 17 [X] 16 [Y] 9 D [X] 10 [Y] 15 [X] 17 [Y] 8 [X] 9 [Y] 16 Pairwise election results (won-tied-lost): 0-0-3 2-0-1 2-0-1 2-0-1 worst pairwise defeat (winning votes): 15 17 16 17 worst pairwise defeat (margins): 5 9 7 9 worst pairwise opposition: 15 17 16 17

Result: Taking only the votes of the second group in account, again, B, C and D form a cycle with clear defeats and A benefits from that because of its relatively close losses against all three and therefore A's biggest defeat is the closest of all candidates. Thus, A is elected Minimax winner by the second group of voters.

#### All voters

Finally, the Minimax winner of the complete set of voters is determined.

# of voters Preferences
1 A > B > C > D
8 A > B > D > C
6 A > D > B > C
2 A > D > C > B
5 B > C > D > A
9 C > B > D > A
6 C > D > B > A
6 D > C > B > A

The results would be tabulated as follows:

 X A B C D Y A [X] 26 [Y] 17 [X] 26 [Y] 17 [X] 26 [Y] 17 B [X] 17 [Y] 26 [X] 23 [Y] 20 [X] 20 [Y] 23 C [X] 17 [Y] 26 [X] 20 [Y] 23 [X] 22 [Y] 21 D [X] 17 [Y] 26 [X] 23 [Y] 20 [X] 21 [Y] 22 Pairwise election results (won-tied-lost): 0-0-3 2-0-1 2-0-1 2-0-1 worst pairwise defeat (winning votes): 26 23 22 23 worst pairwise defeat (margins): 9 3 1 3 worst pairwise opposition: 26 23 22 23

Result: Again, B, C and D form a cycle. But now, their mutual defeats are very close. Therefore, the defeats A suffers from all three are relatively clear. With a small advantage over B and D, C is elected Minimax winner.

#### Conclusion

A is the Minimax winner within the first group of voters and also within the second group of voters. However, both groups combined elect C as the Minimax winner. Thus, Minimax fails the Consistency criterion.

### Ranked pairs

Main article: Ranked pairs

This example shows that the Ranked pairs method violates the Consistency criterion. Assume three candidates A, B and C with 39 voters with the following preferences:

# of voters Preferences
7 A > B > C
6 B > C > A
3 C > A > B
9 A > C > B
8 B > A > C
6 C > B > A

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

#### First group of voters

In the following the Ranked pairs winner for the first group of voters is determined.

# of voters Preferences
7 A > B > C
6 B > C > A
3 C > A > B

The results would be tabulated as follows:

 X A B C Y A [X] 6 [Y] 10 [X] 9 [Y] 7 B [X] 10 [Y] 6 [X] 3 [Y] 13 C [X] 7 [Y] 9 [X] 13 [Y] 3 Pairwise election results (won-tied-lost): 1-0-1 1-0-1 1-0-1
• [X] indicates voters who preferred the candidate listed in the column caption to the candidate listed in the row caption
• [Y] indicates voters who preferred the candidate listed in the row caption to the candidate listed in the column caption

The sorted list of victories would be:

Pair Winner
B (13) vs. C (3) B 13
A (10) vs. B (6) A 10
A (7) vs. C (9) C 9

Result: B > C and A > B are locked in first (and C > A can't be locked in after that), so the full ranking is A > B > C. Thus, A is elected Ranked pairs winner by the first group of voters.

#### Second group of voters

Now, the Ranked pairs winner for the second group of voters is determined.

# of voters Preferences
9 A > C > B
8 B > A > C
6 C > B > A

The results would be tabulated as follows:

 X A B C Y A [X] 14 [Y] 9 [X] 6 [Y] 17 B [X] 9 [Y] 14 [X] 15 [Y] 8 C [X] 17 [Y] 6 [X] 8 [Y] 15 Pairwise election results (won-tied-lost): 1-0-1 1-0-1 1-0-1

The sorted list of victories would be:

Pair Winner
A (17) vs. C (6) A 17
B (8) vs. C (15) C 15
A (9) vs. B (14) B 14

Result: Taking only the votes of the second group in account, A > C and C > B are locked in first (and B > A can't be locked in after that), so the full ranking is A > C > B. Thus, A is elected Ranked pairs winner by the second group of voters.

#### All voters

Finally, the Ranked pairs winner of the complete set of voters is determined.

# of voters Preferences
7 A > B > C
9 A > C > B
8 B > A > C
6 B > C > A
3 C > A > B
6 C > B > A

The results would be tabulated as follows:

 X A B C Y A [X] 20 [Y] 19 [X] 15 [Y] 24 B [X] 19 [Y] 20 [X] 18 [Y] 21 C [X] 24 [Y] 15 [X] 21 [Y] 18 Pairwise election results (won-tied-lost): 1-0-1 2-0-0 0-0-2

The sorted list of victories would be:

Pair Winner
A (25) vs. C (15) A 24
B (21) vs. C (18) B 21
A (19) vs. B (20) B 20

Result: Now, all three pairs (A > C, B > C and B > A) can be locked in without cycle. The full ranking is B > A > C. Thus, Ranked pairs chooses B as winner. In fact, B is also Condorcet winner.

#### Conclusion

A is the Ranked pairs winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the Ranked pairs winner. Thus, the Ranked pairs method fails the Consistency criterion.

### Schulze method

Main article: Schulze method

This example shows that the Schulze method violates the Consistency criterion. Again, assume three candidates A, B and C with 39 voters with the following preferences:

# of voters Preferences
7 A > B > C
6 B > C > A
3 C > A > B
9 A > C > B
8 B > A > C
6 C > B > A

Now, the set of all voters is divided into two groups at the bold line. The voters over the line are the first group of voters; the others are the second group of voters.

#### First group of voters

In the following the Schulze winner for the first group of voters is determined.

# of voters Preferences
7 A > B > C
6 B > C > A
3 C > A > B

The pairwise preferences would be tabulated as follows:

Matrix of pairwise preferences
d[*,A] d[*,B] d[*,C]
d[A,*] 10 7
d[B,*] 6 13
d[C,*] 9 3

Now, the strongest paths have to be identified, e.g. the path A > B > C is stronger than the direct path A > C (which is nullified, since it is a loss for A).

Strengths of the strongest paths
d[*,A] d[*,B] d[*,C]
d[A,*] 10 10
d[B,*] 9 13
d[C,*] 9 9

Result: A > B, A > C and B > C prevail, so the full ranking is A > B > C. Thus, A is elected Schulze winner by the first group of voters.

#### Second group of voters

Now, the Schulze winner for the second group of voters is determined.

# of voters Preferences
9 A > C > B
8 B > A > C
6 C > B > A

The pairwise preferences would be tabulated as follows:

Matrix of pairwise preferences
d[*,A] d[*,B] d[*,C]
d[A,*] 9 17
d[B,*] 14 8
d[C,*] 6 15

Now, the strongest paths have to be identified, e.g. the path A > C > B is stronger than the direct path A > B.

Strengths of the strongest paths
d[*,A] d[*,B] d[*,C]
d[A,*] 15 17
d[B,*] 14 14
d[C,*] 14 15

Result: A > B, A > C and C > B prevail, so the full ranking is A > C > B. Thus, A is elected Schulze winner by the second group of voters.

#### All voters

Finally, the Schulze winner of the complete set of voters is determined.

# of voters Preferences
7 A > B > C
9 A > C > B
8 B > A > C
6 B > C > A
3 C > A > B
6 C > B > A

The pairwise preferences would be tabulated as follows:

Matrix of pairwise preferences
d[*,A] d[*,B] d[*,C]
d[A,*] 19 24
d[B,*] 20 21
d[C,*] 15 18

Now, the strongest paths have to be identified:

Strengths of the strongest paths
d[*,A] d[*,B] d[*,C]
d[A,*] 0 24
d[B,*] 20 21
d[C,*] 0 0

Result: A > C, B > A and B > C prevail, so the full ranking is B > A > C. Thus, Schulze chooses B as winner. In fact, B is also Condorcet winner.

#### Conclusion

A is the Schulze winner within the first group of voters and also within the second group of voters. However, both groups combined elect B as the Schulze winner. Thus, the Schulze method fails the Consistency criterion.

## References

1. ^ John H Smith, "Aggregation of preferences with variable electorate", Econometrica, Vol. 41 (1973), pp. 1027–1041.
2. ^ D. R. Woodall, "Properties of preferential election rules", Voting matters, Issue 3 (December 1994), pp. 8–15.
3. ^ H. P. Young, "Social Choice Scoring Functions", SIAM Journal on Applied Mathematics Vol. 28, No. 4 (1975), pp. 824–838.