blob: 6d66073b83f3311ce6c8cbdd84a34213147ebe6f (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
<p>To be determined</p>
<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="https://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.6.
</p>
|
