[EM] a Schulze implementation

[Árpád Magosányi]

Hi!

Found a bug in the previous, the ranking used d[] instead of p[]. It is
fixed.
This version also displays p[n-1,n] vs p[n, n-1] to show how serious the
beat is, but I cannot interpret it. What does it actually mean? :)

2010/4/25 Árpád Magosányi <magwas at rabic.org>

> Hi!
>
> Here is a Schulze implementation, written in python, using gtk.
> Please someone confirm whether the last step of ranking candidates done
> correctly. It is in class Result, function compute.
> It gives correct result for the Tennessee example, but I am not sure.
>
> It is specifically written for situations like a village meeting: lot of
> people, one computer, and the result should be known instantly.
> Voting is done by directly asking for relative preferences, so pairwise
> matrix is entered directly.
> In config tab you can give the number of candidates (default=5)
> In vote tab you give the names, and the pairwise matrix. The matrix gives
> the number of voters who preferred the candidate listed in the row caption
> to the candidate in the row corresponding to the column.
> Clicking on the result tab gives the ranking of the candidates.
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20100425/9171fd6e/attachment-0004.htm>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: condorcet.py
Type: text/x-python
Size: 6527 bytes
Desc: not available
URL: <http://lists.electorama.com/pipermail/election-methods-electorama.com/attachments/20100425/9171fd6e/attachment-0004.py>