Re: [s-d] [s-b] amending: more elections

[bd <nomic@xxxxxxx>]

shadowfirebird@xxxxxxxxx wrote:

>> you don't have to put it in English explicitly, you can just say:
>> voters vote by ranking the candidates from their most favorite to their
>> least favorite.
>> candidate X has a pairwise victory over candidate Y if more voters rank
>> X over Y than Y over X.
>> the winner of the election is the candidate that pairwise beats all
>> other candidates (if such a candidate exists)
>>
>> done
> 
> Hmm.  A lot simpler to describe than to do, then.  That was me
> thinking as programmer not as legislator, obviously...

It's not that hard to implement, really. Just build a directed graph, 
where each vertex is a candidate, and each edge goes from a victor to a 
loser in each pairwise victory. Now find the vertex with no incoming 
edges. Ties should be represented by two edges in each direction between 
the vertices in question. If there is no victor, then start thinking 
about removing edges :)
_______________________________________________
spoon-discuss mailing list
spoon-discuss@xxxxxxxxx
http://lists.ellipsis.cx/mailman/listinfo/spoon-discuss