Chris, For the benefit of those who are just joining us, I'll start a little more basic than you would need.
We need to know the meaning of "cover." A candidate X covers a candidate Y if and only if X (pairwise) defeats both Y and each candidate that Y defeats. So if X covers Y, then in a pairwise sense X dominates Y. Now for UncAAO: 1. Write abbreviations for all of the candidate names on a big sheet of butcher paper. 2. For each candidate X, if X is covered by some candidate, then draw an arrow from X to the candidate (among those that cover X) against which X has the least approval opposition. 3. If X is not covered by any candidate, then do not draw any arrow from X to another candidate. 4. Once all of the arrows have been drawn, start at the candidate A with the most approval, and follow the arrows until you reach (the name of) an uncovered candidate. This candidate is the winner. Forest Chris Benham wrote: > > >Forest W Simmons wrote: > >>UncAAO stands for Uncovered, Approval, Approval Opposition. Here's how >>it works: >> >>For each candidate X, >> >>if X is uncovered, >> >>then let f(X)=X, >> >>else let f(X) be the candidate against which X has the least approval >>opposition, among those candidates that cover X. >> >>Start with the approval winner A and apply the function f repeatedly >>until the output equals the input. This "fixed point" of f is the >>method winner. >> > >Is there any chance that someone who understands this will translate it >into plain English? > > >Chris Benham > > >> >> >> >> > ---- election-methods mailing list - see http://electorama.com/em for list info