Debian Project Leader Elections 2012

Time Line

Nomination period: Sunday, March 4th 00:00:00 UTC, 2012 Saturday, March 10th 23:59:59 UTC, 2012
Campaigning period: Sunday, March 11th 00:00:00 UTC, 2012 Saturday, March 31st 23:59:59 UTC, 2012
Voting period: Sunday, April 1st, 00:00:00 UTC, 2012 Saturday, April 14th, 23:59:59 UTC, 2012

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

Nominations

  1. Wouter Verhelst [[email protected]] [nomination mail] [platform]
  2. Gergely Nagy [[email protected]] [nomination mail] [platform]
  3. Stefano Zacchiroli [[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 be produced with the hash of the alias of the voter rather than the name; the alias shall be sent to the corresponding voter along with the acknowledgement of the ballot so that people may verify that their votes were correctly tabulated. While the voting is open the tally will be a dummy one; after the vote, the final tally sheet will be put in place. Please note that for secret ballots the md5sum on the dummy tally sheet is randomly generated, as otherwise the dummy tally sheet would leak information relating the md5 hash and the voter.

Quorum

With the current list of voting developers, we have: 

 Current Developer Count = 948
 Q ( sqrt(#devel) / 2 ) = 15.3948043183407
 K min(5, Q )           = 5
 Quorum  (3 x Q )       = 46.184412955022

Quorum

Majority Requirement

All candidates would need 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
Option 1   203 37 310
Option 2 97   34 281
Option 3 347 354   385
Option 4 60 78 12  

Looking at row 2, column 1, Gergely Nagy
received 97 votes over Wouter Verhelst

Looking at row 1, column 2, Wouter Verhelst
received 203 votes over Gergely Nagy.

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