Debian Project Leader Elections 2016

Time Line

Nomination period: Sunday, March 6th 00:00:00 UTC, 2016 Saturday, March 12th 23:59:59 UTC, 2016
Campaigning period: Sunday, March 13th 00:00:00 UTC, 2016 Saturday, April 2nd 23:59:59 UTC, 2016
Voting period: Sunday, April 3rd, 00:00:00 UTC, 2016 Saturday, April 16th, 23:59:59 UTC, 2016

Please note that the new term for the project leader shall start on April 17th, 2016.

Nominations

  1. Mehdi Dogguy [[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 leader2016.

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. 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

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
Option 1   265
Option 2 13  

Looking at row 2, column 1, None Of The Above
received 13 votes over Mehdi Dogguy

Looking at row 1, column 2, Mehdi Dogguy
received 265 votes over None Of The Above.

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