[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Demexp-dev] Re: Some questions on Condorcet voting
|
From: |
David MENTRE |
|
Subject: |
[Demexp-dev] Re: Some questions on Condorcet voting |
|
Date: |
Sun, 10 Aug 2003 18:22:36 +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.
> Quoting the web page: "Condorcet is simpler, but SSD is the state of the
> art.". Should I implement SSD?
Should I implement the cloneproof version?
Yours,
d.
--
address@hidden