Open Stack

Correction:  The by laws call for the use of the Cumulative Method for this election:  http://en.wikipedia.org/wiki/Cumulative_voting

IANAL but my understanding is that this was a good solution that also works under Delaware law.



On Wednesday, August 1, 2012 6:29pm, "Stefano Maffulli" <stefano at openstack.org> said:

> 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
>