Debian Project Leader Elections 2013
Time Line
| Nomination period: | Sunday, March 3th 00:00:00 UTC, 2013 | Saturday, March 9th 23:59:59 UTC, 2013 |
|---|---|---|
| Campaigning period: | Sunday, March 10th 00:00:00 UTC, 2013 | Saturday, March 30th 23:59:59 UTC, 2013 |
| Voting period: | Sunday, March 31st, 00:00:00 UTC, 2013 | Saturday, April 13th, 23:59:59 UTC, 2013 |
Please note that the new term for the project leader shall start on April 17th, 2013.
Nominations
- Gergely Nagy [algernon@debian.org] [nomination mail] [platform]
- Moray Allan [moray@debian.org] [nomination mail] [platform]
- Lucas Nussbaum [lucas@debian.org] [nomination mail] [platform]
The ballot, when ready, can be requested through email by sending a signed email to ballot@vote.debian.org with the subject leader2013.
Data and Statistics
This year, like always, statistics will be gathered about ballots received and acknowledgements sent periodically during the voting period. Additionally, the list of voters will be recorded. Also, the tally sheet will also be made available to be viewed. Please remember that the project leader election has a secret ballot, so the tally sheet will not contain the voter's name but a HMAC that allows the voters to check that their vote is in the list of votes. There is a key generated for each voter that is send along with the ack for the vote.
Quorum
With the current list of voting developers, we have:
Current Developer Count = 988
Q ( sqrt(#devel) / 2 ) = 15.7162336455017
K min(5, Q ) = 5
Quorum (3 x Q ) = 47.1487009365051
Quorum
- Option1 Reached quorum: 319 > 47.1487009365051
- Option2 Reached quorum: 355 > 47.1487009365051
- Option3 Reached quorum: 353 > 47.1487009365051
Majority Requirement
All candidates would need a simple majority to be eligible.
Majority
- Option1 passes Majority. 6.255 (319/51) >= 1
- Option2 passes Majority. 14.792 (355/24) >= 1
- Option3 passes Majority. 11.767 (353/30) >= 1
Outcome
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.
- Option 1 "Gergely Nagy"
- Option 2 "Moray Allan"
- Option 3 "Lucas Nussbaum"
- Option 4 "None Of The Above"
In the following table, tally[row x][col y] represents the votes that option x received over option y. A more detailed explanation of the beat matrix may help in understanding the table. For understanding the Condorcet method, the Wikipedia entry is fairly informative.
| Option | ||||
|---|---|---|---|---|
| 1 | 2 | 3 | 4 | |
| Option 1 | 88 | 62 | 319 | |
| Option 2 | 252 | 141 | 355 | |
| Option 3 | 279 | 210 | 353 | |
| Option 4 | 51 | 24 | 30 | |
Looking at row 2, column 1, Moray Allan
received 252 votes over Gergely Nagy
Looking at row 1, column 2, Gergely Nagy
received 88 votes over Moray Allan.
Pair-wise defeats
- Option 2 defeats Option 1 by ( 252 - 88) = 164 votes.
- Option 3 defeats Option 1 by ( 279 - 62) = 217 votes.
- Option 1 defeats Option 4 by ( 319 - 51) = 268 votes.
- Option 3 defeats Option 2 by ( 210 - 141) = 69 votes.
- Option 2 defeats Option 4 by ( 355 - 24) = 331 votes.
- Option 3 defeats Option 4 by ( 353 - 30) = 323 votes.
The Schwartz Set contains
- Option 3 "Lucas Nussbaum"
The winners
- Option 3 "Lucas Nussbaum"
Debian uses the Condorcet method for voting.
Simplistically, plain Condorcets method
can be stated like so :
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.
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
Cloneproof Schwartz Sequential Dropping
for details. Debian's variation is spelled out in the
constitution,
specifically, A.6.
Debian Project Secretary