[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Demexp-dev] Re: Some questions on Condorcet voting

From: David MENTRE
Subject: Re: [Demexp-dev] Re: Some questions on Condorcet voting
Date: Sat, 16 Aug 2003 17:49:09 +0200
User-agent: Gnus/5.1002 (Gnus v5.10.2) Emacs/21.2 (gnu/linux)

David MENTRE <address@hidden> writes:

>> I have not read all the details, but it appears to exist two algorithms
>> to solve Cyclic Ambiguities : Basic Condorcet and Schwartz Sequential
>> Dropping (SSD).
> And there are two variants for SSD: "plain" version and the "cloneproof"
> version.

Ok, I have finally implemented both of them (see for
code example). 

I have followed rules in the Debian Constitution
( to implement SSD. The web site is not very clear. 

I have implemented some hairy test cases (cyclic 3 parts tie) and it
seems to work. However more checks are needed.

The scoring of defeats could be improved, following once again
definitions in the Debian Constitution.

I have tried to document the code in a literate programming way. So I
would consider as a bug if you cannot understand what I have done.

 David Mentré <address@hidden>
 GnuPG key fingerprint: A7CD 7357 3EC4 1163 745B  7FD3 FB3E AD7C 2A18 BE9E

reply via email to

[Prev in Thread] Current Thread [Next in Thread]