Forest,
First, I have some thoughts on the below:
--- Forest Simmons <[EMAIL PROTECTED]> a écrit :
> Yes, Joe Weinstein's strategy is what I had in mind.
I'm starting to think that the method is not so much about what strategy is
used, as about the high quality of information that each voter e
Forest,
I implemented the new method (picking the least viable rank and merging it with
the less viable neighbor) and did some trials.
First, I should say that the Condorcet cycle-breaker I have implemented is:
"Successively drop the weakest defeats (as measured by WV) until a Smith set
member is
Forest,
--- Forest Simmons <[EMAIL PROTECTED]> a écrit :
> Kevin, I think that the refined method can be slightly improved as
> outlined below.
I implemented the (original) refined method and it seems to be a great
improvement, although I haven't done a side-by-side comparison. (I was
judging
--- Forest Simmons <[EMAIL PROTECTED]> a écrit :
> This method recursively converts a set of CR ballots with resolution n to
> a set of CR ballots of resolution n-1, and stops at resolution two, i.e.
> approval ballots.
Nice. I do believe I'll program this, and see how likely this is to produce
This method recursively converts a set of CR ballots with resolution n to
a set of CR ballots of resolution n-1, and stops at resolution two, i.e.
approval ballots.
We start with a set of Cardinal Ratings (CR) ballots on which every
candidate is rated by a whole number in the range one to n.
Pro
