Debian Project Leader Elections 2019

Time Line

Nomination period: Sunday 2019-03-03 00:00:00 UTC Saturday 2019-03-16 23:59:59 UTC
Campaigning period: Sunday 2019-03-17 00:00:00 UTC Saturday 2019-04-06 23:59:59 UTC
Voting period: Sunday 2019-04-07 00:00:00 UTC Saturday 2019-04-20 23:59:59 UTC

Nominations

  1. Joerg Jaspert [[email protected]] [nomination mail] [platform]
  2. Jonathan Carter [[email protected]] [nomination mail] [platform]
  3. Sam Hartman [[email protected]] [nomination mail] [platform]
  4. Martin Michlmayr [[email protected]] [nomination mail] [platform]

Withdrawals

The ballot, when ready, can be requested through email by sending a signed email to [email protected] with the subject leader2019.

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 = 1003
 Q ( sqrt(#devel) / 2 ) = 15.8350876221131
 K min(5, Q )           = 5
 Quorum  (3 x Q )       = 47.5052628663393

Quorum

Majority Requirement

The candidate needs a simple majority to be eligible.

Majority

Outcome

Graphical rendering of the results

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.

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.

The Beat Matrix
 Option
  1 2 3 4 5
Option 1   169 128 169 319
Option 2 166   109 172 323
Option 3 217 206   202 336
Option 4 180 174 134   324
Option 5 51 37 26 35  

Looking at row 2, column 1, Jonathan Carter
received 166 votes over Joerg Jaspert

Looking at row 1, column 2, Joerg Jaspert
received 169 votes over Jonathan Carter.

Pair-wise defeats

The Schwartz Set contains

The winners

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