Don Armstrong, David Nusinow, Thaddeus H. Black,
Martin-Éric Racine, and MJ Ray have agreed to be
debate moderators. I would like to extend the thanks of
the project for their stellar work in conducting an
excellently orchestrated debate, and a professionally
rendered debate log. A transcript
of the debate is available for review.

This year, like always, some
statistics
have been gathered about ballots received and acknowledgements sent
periodically during the voting period. Additionally, the
list of voters
has been recorded. Also,
the tally
sheet is also available to be viewed. Please
remember that the project leader election has a secret
ballot, so the tally sheet is produced with the hash of
the alias of the voter rather than the name; the alias
having been sent to the corresponding voter when the
acknowledgement of the ballot was sent so that people may
verify that their votes are correct. While the voting was
still open the tally was a dummy one; after the vote, the
final tally sheet has been 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.

The winner of the election is Anthony Towns

I would like to thank all the candidates for their
service to the project, for standing for the post of
project leader, and for offering the developers a strong
and viable group of candidates.

Total unique votes cast: 421, which is 43.3127572% of all
possible votes.

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 Schwartz Set contains

Option 4 "Anthony Towns"

The winners

Option 4 "Anthony Towns"

Debian uses the Condorcet method for votes.
Simplistically, plain Condorcet's 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 relations ship 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
the constitution,
specifically, § A.6.