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
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
<p class="center">
<a style="margin-left: auto; margin-right: auto;" href="vote_001_results.dot">
<img src="vote_001_results.png" alt="Graphical rendering of the results">
</a>
</p>
<p>
In the graph above, any pink colored nodes imply that
the option did not pass majority, the Blue is the
winner. The Octagon is used for the options that did
not beat the default.
</p>
<ul>
<li>Option 1 "Andreas Tille"</li>
<li>Option 2 "Sruthi Chandran"</li>
<li>Option 3 "None of the above"</li>
</ul>
<p>
In the following table, tally[row x][col y] represents
the votes that option x received over option y. A
<a href="http://en.wikipedia.org/wiki/Schwartz_method">more
detailed explanation of the beat matrix</a> may help in
understanding the table. For understanding the Condorcet method, the
<a href="http://en.wikipedia.org/wiki/Condorcet_method">Wikipedia
entry</a> is fairly informative.
</p>
<table class="vote">
<caption class="center"><strong>The Beat Matrix</strong></caption>
<tr><th> </th><th colspan="3" class="center">Option</th></tr>
<tr>
<th> </th>
<th> 1 </th>
<th> 2 </th>
<th> 3 </th>
</tr>
<tr>
<th>Option 1 </th>
<td> </td>
<td> 201 </td>
<td> 293 </td>
</tr>
<tr>
<th>Option 2 </th>
<td> 135 </td>
<td> </td>
<td> 280 </td>
</tr>
<tr>
<th>Option 3 </th>
<td> 64 </td>
<td> 66 </td>
<td> </td>
</tr>
</table>
<p>
Looking at row 2, column 1, Sruthi Chandran<br/>
received 135 votes over Andreas Tille<br/>
<br/>
Looking at row 1, column 2, Andreas Tille<br/>
received 201 votes over Sruthi Chandran.<br/>
<h3>Pair-wise defeats</h3>
<ul>
<li>Option 1 defeats Option 2 by ( 201 - 135) = 66 votes.</li>
<li>Option 1 defeats Option 3 by ( 293 - 64) = 229 votes.</li>
<li>Option 2 defeats Option 3 by ( 280 - 66) = 214 votes.</li>
</ul>
<h3>The Schwartz Set contains</h3>
<ul>
<li>Option 1 "Andreas Tille"</li>
</ul>
<h3>The winners</h3>
<ul>
<li>Option 1 "Andreas Tille"</li>
</ul>
<p>
Debian uses the Condorcet method for voting.
Simplistically, plain Condorcets method
can be stated like so : <br/>
<q>Consider all possible two-way races between candidates.
The Condorcet winner, if there is one, is the one
candidate who can beat each other candidate in a two-way
race with that candidate.</q>
The problem is that in complex elections, there may well
be a circular relationship in which A beats B, B beats C,
and C beats A. Most of the variations on Condorcet use
various means of resolving the tie. See
<a href="http://en.wikipedia.org/wiki/Cloneproof_Schwartz_Sequential_Dropping">Cloneproof Schwartz Sequential Dropping</a>
for details. Debian's variation is spelled out in the
<a href="$(HOME)/devel/constitution">constitution</a>,
specifically, A.5.
</p>
|
