Debian Project Leader Elections 2015
Time Line
| Nomination period: | Wednesday, March 4th 00:00:00 UTC, 2015 | Tuesday, March 10th 23:59:59 UTC, 2015 |
|---|---|---|
| Campaigning period: | Wednesday, March 11th 00:00:00 UTC, 2015 | Tuesday, March 31th 23:59:59 UTC, 2015 |
| Voting period: | Wednesday, April 1st, 00:00:00 UTC, 2015 | Tuesday, April 14th, 23:59:59 UTC, 2015 |
Please note that the new term for the project leader shall start on April 17th, 2015.
Nominations
- Mehdi Dogguy [[email protected]] [nomination mail] [platform]
- Gergely Nagy [[email protected]] [nomination mail] [platform]
- Neil McGovern [[email protected]] [nomination mail] [platform]
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 = 986
Q ( sqrt(#devel) / 2 ) = 15.7003184681076
K min(5, Q ) = 5
Quorum (3 x Q ) = 47.1009554043227
Quorum
- Option1 Reached quorum: 325 > 47.1009554043227
- Option2 Reached quorum: 263 > 47.1009554043227
- Option3 Reached quorum: 314 > 47.1009554043227
Majority Requirement
All candidates would need a simple majority to be eligible.
Majority
- Option1 passes Majority. 15.476 (325/21) >= 1
- Option2 passes Majority. 3.554 (263/74) >= 1
- Option3 passes Majority. 10.828 (314/29) >= 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 "Mehdi Dogguy"
- Option 2 "Gergely Nagy"
- Option 3 "Neil McGovern"
- 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 | 260 | 119 | 325 | |
| Option 2 | 47 | 52 | 263 | |
| Option 3 | 203 | 278 | 314 | |
| Option 4 | 21 | 74 | 29 | |
Looking at row 2, column 1, Gergely Nagy
received 47 votes over Mehdi Dogguy
Looking at row 1, column 2, Mehdi Dogguy
received 260 votes over Gergely Nagy.
Pair-wise defeats
- Option 1 defeats Option 2 by ( 260 - 47) = 213 votes.
- Option 3 defeats Option 1 by ( 203 - 119) = 84 votes.
- Option 1 defeats Option 4 by ( 325 - 21) = 304 votes.
- Option 3 defeats Option 2 by ( 278 - 52) = 226 votes.
- Option 2 defeats Option 4 by ( 263 - 74) = 189 votes.
- Option 3 defeats Option 4 by ( 314 - 29) = 285 votes.
The Schwartz Set contains
- Option 3 "Neil McGovern"
The winners
- Option 3 "Neil McGovern"
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