Debian Project Leader Elections 2022
Time Line
| Nomination period: | Saturday 2022-03-05 00:00:00 UTC | Friday 2022-03-11 23:59:59 UTC |
|---|---|---|
| Campaigning period: | Saturday 2022-03-12 00:00:00 UTC | Friday 2022-04-01 23:59:59 UTC |
| Voting period: | Sunday 2022-04-03 00:00:00 UTC | Saturday 2022-04-16 23:59:59 UTC |
Please note that the new term for the project leader shall start on 2022-04-21.
Nominations
- Felix Lechner [[email protected]] [nomination mail] [platform]
- Jonathan Carter [[email protected]] [nomination mail] [platform]
- Hideki Yamane [[email protected]] [nomination mail] [platform]
The ballot, when ready, can be requested through email by sending a signed email to [email protected] with the subject leader2022.
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 = 1023
Q ( sqrt(#devel) / 2 ) = 15.9921855917195
K min(5, Q ) = 5
Quorum (3 x Q ) = 47.9765567751584
Quorum
- Option 1 Reached quorum: 151 > 47.9765567751584
- Option 2 Reached quorum: 327 > 47.9765567751584
- Option 3 Reached quorum: 290 > 47.9765567751584
Majority Requirement
The candidates need a simple majority to be eligible.
Majority
- Dropping Option 1 because of Majority. 0.803 (151/188) <= 1
- Option 2 passes Majority. 14.864 (327/22) > 1
- Option 3 passes Majority. 5.472 (290/53) > 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 "Felix Lechner"
- Option 2 "Jonathan Carter"
- Option 3 "Hideki Yamane"
- 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 | 52 | 84 | 151 | |
| Option 2 | 294 | 266 | 327 | |
| Option 3 | 229 | 69 | 290 | |
| Option 4 | 188 | 22 | 53 | |
Looking at row 2, column 1, Jonathan Carter
received 294 votes over Felix Lechner
Looking at row 1, column 2, Felix Lechner
received 52 votes over Jonathan Carter.
Pair-wise defeats
- Option 2 defeats Option 3 by ( 266 - 69) = 197 votes.
- Option 2 defeats Option 4 by ( 327 - 22) = 305 votes.
- Option 3 defeats Option 4 by ( 290 - 53) = 237 votes.
The Schwartz Set contains
- Option 2 "Jonathan Carter"
The winners
- Option 2 "Jonathan Carter"
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