Finding the probable best candidate?

[Rob LeGrand]

Forest wrote:
> In three way races Black, Ranked Pairs, and SSD all give the same answer
> if there are no truncations, so none has any possible advantage over the
> others in three way races without truncations.

What about the election

9:A>B>C
8:B>C>A
6:C>A>B

B wins under Black but A wins under Schulze and Ranked Pairs (plus Baldwin,
Dodgson, Nanson and Minmax).

> And (as I said before) the only reason I proposed Bubble Sorted Borda was
> to find a simple method that would beat Black along the same lines as
> Black.

Unfortunately, at least according to my simulations so far, BSBS is much worse
at SU given sincere votes than BSSE or Black.  But it's not bad; it's about on
par with Schulze and is better than Ranked Pairs.  By the way, I think the sort
BSBS uses is actually called an insertion sort, not a bubble sort.

> After experience with all of these four (and other closely related) 
> methods I believe that Inverse Nanson (an iterated form of Borda Runoff)
> is the best of these four methods based on Borda.

What is Inverse Nanson again?  How is it different from regular Nanson (or
Baldwin)?  Is it monotonic?

=====
Rob LeGrand
honky98 at aggies.org
http://www.aggies.org/honky98/

__________________________________________________
Do You Yahoo!?
Yahoo! Sports - Coverage of the 2002 Olympic Games
http://sports.yahoo.com