-
Notifications
You must be signed in to change notification settings - Fork 1
/
Condorcet_Criterion.mw
70 lines (38 loc) · 4.72 KB
/
Condorcet_Criterion.mw
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
The '''Condorcet candidate''', '''Pairwise Champion''' (PC), or '''Condorcet winner''' (CW) of an [[election]] is the candidate who, when compared in turn with each of the other candidates, is preferred over the other candidate. On a one-dimensional [[political spectrum]], the pairwise champion will be at the position of the median voter. Mainly because of Condorcet's [[voting paradox]], a pairwise champion will not always exist in a given set of votes. If the pairwise champion exists, they will be the only candidate in the [[Smith set]]; otherwise, the Smith set will have three or more members.
The '''Condorcet criterion''' for a [[voting system]] is that it chooses the pairwise champion when one exists. Any method conforming to the Condorcet criterion is known as a [[Condorcet method]].
== A More General Wording of Condorcet Criterion Definition ==
'''Requirements:'''
1. The voting system must allow the voter to vote as many transitive pairwise preferences as desired.
(Typically that's in the form of an unlimited ranking)
2. If there are one or more unbeaten candidates, then the winner should be an unbeaten candidate.
'''Traditional definition of "beat":'''
X beats Y iff more voters vote X over Y than vote Y over X.
'''Alternative definition of "beat" that is claimed to be more consistent with the preferences, intent and wishes of equal-top-ranking voters:'''
(Argument supporting that claim can be found at the [[Symmetrical ICT]] article.)
(X>Y) means the number of ballots voting X over Y.
(Y>X) means the number of ballots voting Y over X.
(X=Y)T means the number of ballots voting X and Y at top
(a ballot votes a candidate at top if it doesn't vote anyone over him/her)
X beats Y iff (X>Y) > (Y>X) + (X=Y)T
[end of alternative definition]
With this alternative definition of "beat", [[FBC]] and the Condorcet Criterion are compatible.
== Majority Condorcet criterion ==
The majority Condorcet criterion is the same as the above, but with "beat" replaced by "majority-beat", defined to be "X majority-beats Y iff over 50% voters vote X over Y."
==Complying methods==
Black, [[Condorcet//Approval]], Smith/IRV, [[Copeland's method|Copeland]], [[Llull-Approval Voting]], [[Minmax]], Smith/Minmax, [[ranked pairs]] and variations ([[maximize affirmed majorities]], [[maximum majority voting]]), and [[Schulze method|Schulze]] comply with the Condorcet criterion.
It has been recently argued that the definition of the verb "beat" should be regarded as external to the Condorcet Criterion...and that "beat should be defined in a way that interprets equal-top ranking consistent with the actual preferences, intent and wishes of the equal-top-ranking voters. When such a definition of "beat" is used in the Condorcet Criterion definition, then the Condorcet Criterion is compatible with [[FBC]], and there are Condorcet methods that pass [[FBC]]. Discussion and arguments on that matter can be found at the [[Symmetrical ICT]] article.
[[Approval voting]], [[Range voting]], [[Borda count]], [[plurality voting]], and [[instant-runoff voting]] do not comply with the Condorcet Criterion.
==Commentary==
Non-ranking methods such as [[plurality voting|plurality]] and [[approval voting|approval]] cannot comply with the Condorcet criterion because they do not allow each voter to fully specify their preferences. But instant-runoff voting allows each voter to rank the candidates, yet it still does not comply. A simple example will prove that IRV fails to comply with the Condorcet criterion.
Consider, for example, the following vote count of preferences with three candidates {A,B,C}:
<blockquote><table>
<tr><td align=right>499:</td><td align=left>A>B>C</td></tr>
<tr><td align=right>498:</td><td align=left>C>B>A</td></tr>
<tr><td align=right>3:</td><td align=left>B>C>A</td></tr>
</table></blockquote>
In this case, B is preferred to A by 501 votes to 499, and B is
preferred to C by 502 to 498, hence B is preferred to both A and C. So
according to the Condorcet criteria, B should win. By contrast, according to the rules of IRV, B is ranked first by the fewest voters and is eliminated, and C wins with the transferred voted from B; in plurality voting A wins with the most first choices.
Range voting does not comply because it allows for the difference between 'rankings' to matter. E.g. 51 people might rate A at 100, and B at 90, while 49 people rate A at 0, and B at 100. Condorcet would consider this 51 people voting A>B, and 49 voting B>A, and A would win. Range voting would see this as A having support of 5100/100 = 51%, and B support of (51*90+49*100)/100 = 94.9%; range voting advocates would probably say that in this case the Condorcet winner is not the socially ideal winner.
[[Category:Voting system criteria]]
{{fromwikipedia}}