Dear Jobst,
Draw a ballot at random. Use the ranking on this ballot to rank all of the
other ballots from worst to best
according to their favorites.
Elect the favorite indicated on the k_th ballot with probability 2*k/(n+n^2) ,
where n is the number of
ballots.
Can this be adapted to
On Jun 27, 2008, at 13:54 , Kristofer Munsterhjelm wrote:
That could be one big poster where the candidates are listed on
the right hand side and the left hand side is used for
representing the tree structure (and the names of the parties and
the subgroups).
That could work, at least in c
That could be one big poster where the candidates are listed on the
right hand side and the left hand side is used for representing the tree
structure (and the names of the parties and the subgroups).
That could work, at least in cases where there's only one district and
the party limits the d
Pretty cool.
I was curious how my condorcet bar chart thing worked on the results:
http://karmatics.com/voting/bars.html
Unfortunately that many candidates doesn't fit very well on a smaller
monitor, I'm sure I could tweak it to display more compactly, but in the
meantime here is a scaled down i
