This post is to put on record a corrected version, with some
examples, to demonstrate its ability to do elementary PR.
---
Credit for the basic idea of this method goes to Chris Benham. The
following is intended to be a description of his proposed method,
written in t
At 2:04 AM +0930 8/24/03, Chris Benham wrote:
I expect this to result in
fewer/less serious srategy problems, paying the relatively small
price of sometimes
electing the "wrong" member of the Smith set.
Why do you believe the middle preferences of a voter should matter
less then the highest or lo
In response to this example:
31: B>A>E>C>D
23: C>B>A>E>D
25: D>A>C>E>B
11: D>C>B>A>E
10: E>A>C>B>D
100 voters, the Smith set is ABC.
which in pairwise terms,boils down to (with the margins in brackets)
C>B 69-31 (38)
A>C 66-34 (32)
B>A 65-35 (30)
Eric Gorr wrote:
"Now, the defeat that could
At 7:10 PM -0400 8/22/03, John B. Hodges wrote:
I am not a computer-science major, but I have heard of the
"traveling salesman" problem and how it is computationally very
expensive to guarantee finding the ideal solution, to the point of
being practically impossible for large numbers of cities.
Dear Mike,
you wrote (23 Aug 2003):
> Markus said:
> > The fact that the binary methods are all vulnerable to
> > preference misrepresentation of an equal difficulty is
> > not surprising as the winning criterion of these methods
> > is a binary one by definition. Hence all relevant
> > informatio
