Open Stack

Condorcet methods, like all voting systems, have weaknesses that can
be exploited to influence the outcome in a desired direction (beyond
the influence of an individual voting sincerely, of course).  The
choice of voting scheme is certainly interesting, but in no way
influences the argument that the current system is subject to
straightforward manipulation in various ways by the most powerful
participants.  Reducing the attack surface is in the best interests of
the project and the foundation.


b

On Wed, Aug 1, 2012 at 3:29 PM, Stefano Maffulli <stefano at openstack.org> wrote:
> On 08/01/2012 03:17 PM, Matt Joyce wrote:
>> You are assuming a binary set.
>>
>> In the event that :
>>
>> 25% vote for A
>> 17% vote for B
>> 35% vote for C
>> 23% vote for D
>>
>> If 35% the majority vote is 95% one block of individual, the loudest
>> minority wins.  This is a problem.
>
> We'll be using the Condorcet voting system, as we do for PTL and PPB
> elections in the past. There is no 25% vote for A or B. There is a
> matrix of preferences... Wikipedia explains it:
>
> https://en.wikipedia.org/wiki/Condorcet_method
>
> A Condorcet method is any election method that elects the candidate that
> would win by majority rule in all pairings against the other candidates,
> whenever one of the candidates has that property.
>
> hth
> /stef
>
> _______________________________________________
> Foundation mailing list
> Foundation at lists.openstack.org
> http://lists.openstack.org/cgi-bin/mailman/listinfo/foundation