Debian Project Leader Elections 2009

Time Line

Nomination period: Sunday, March 1st 00:00:00 UTC, 2009 Saturday, March 7th 23:59:59 UTC, 2009
Campaigning period: Sunday, March 8th 00:00:00 UTC, 2009 Saturday, March 28th 23:59:59 UTC, 2009
Voting period: Sunday, March 29th, 00:00:00 UTC, 2009 Saturday, April 11th, 23:59:59 UTC, 2009

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


  1. Stefano Zacchiroli [] [nomination mail] [platform]
  2. Steve McIntyre [] [nomination mail] [platform]

The ballot, when ready, can be requested through email by sending a signed email to with the subject leader2009.

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.


With the current list of voting developers, we have:

 Current Developer Count = 1013
 Q ( sqrt(#devel) / 2 ) = 15.9138304628395
 K min(5, Q )           = 5
 Quorum  (3 x Q )       = 47.7414913885186


Majority Requirement

All candidates would need a simple majority to be eligible.



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
  1 2 3
Option 1   142 323
Option 2 185   329
Option 3 23 22  

Looking at row 2, column 1, Steve McIntyre
received 185 votes over Stefano Zacchiroli

Looking at row 1, column 2, Stefano Zacchiroli
received 142 votes over Steve McIntyre.

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