[EM] Missing what?

[Dave Ketchum]

I thought this was complete.  It avoids fancy math and cycles described as
such.  I sent it in on Sun, 16 Oct 2005 16:02:30 -0400 as
Subject: [Condorcet] Proposed Statutory Rules for Beatpath - Cmplete
===========================['

     > Instant Round Robin Voting: Tabulation
     > {aka CSSD(wv), aka Schulze(wv)}
     >
Based on what Markus did, but without math expressions.  Does not exactly
follow his design, but I claim identical results thru 3-member cycles, and
similar results for more complex cycles where it matters less, and
promises to always complete as defined.  Omits majority winner, for which
I see no value - trivial to add.

Also simplifies path for winners, for 3-candidate cycles, and for more
complex cycles.
-----------------------------

Article 1

Each ballot shall list all qualified candidates for the office, and the
voter shall be allowed to write in one additional candidate.  On the
ballot, the voter shall be allowed to rank candidates in order of
preference, assigning a rank below any ranked by leaving candidates
unranked.  A voter may also rank two or more candidates equally, or use
ranks non-consecutively.  The number of ranks shall be sufficient for a
voter to express a separate rank for each candidate.  A valid ballot
ranking one candidate higher than another shall be counted as a vote cast
for the higher ranked candidate in the pairwise, or one-on-one, contest
between those two candidates.  A valid ballot ranking two candidates
equally casts no vote for either candidate in their pairwise contest.

Note:  Higher, as used here, means preferred.  Ballots must make clear to
voters whether "1" means more or less preference than "9".

This counting results in an array for the district (e.g., for candidates 2
and 4, A(2,4) holds count for 2, while A(4,2) holds count for 4).  If the
counting results in separate arrays for precincts, they are simply summed
for the district array.

Article 2

Search the array for the largest count.  This identifies a possible
winner.  Check this candidate as to defeating each other candidate.
Winning every pairwise race makes this candidate the winner.  Done.

Start list C with this candidate.  For each pairwise race lost by this
candidate, enter the pair identity in list L and add any new winning
candidate to list C.  Repeat for each candidate added to list C.

Article 3

Repeat following deletions, in order, until list L is empty.  Then the
remembered candidate is winner.  Done.

Make list W of the links with the weakest winning vote counts in list L.
If more than one, substitute the losing vote counts for these links,
deleting all except the strongest of these.  For every link in list W,
delete the corresponding link in list L.  Remember the winner of the last
deleted link as possible winner.

Delete all links in list L for which winner is not loser in any link in
list L, or loser is not winner in any link in list L.
-- 
      davek at clarityconnect.com    people.clarityconnect.com/webpages3/davek
      Dave Ketchum   108 Halstead Ave, Owego, NY  13827-1708   607-687-5026
                  Do to no one what you would not want done to you.