[Date Prev][Date Next] [Thread Prev][Thread Next] [Date Index] [Thread Index]

Re: April 17th Draft of the Voting GR



>> On Fri, 18 Apr 2003 13:22:37 +0200,
>> Matthias Urlichs <smurf@smurf.noris.de> said: 

 > Proposed change to make this more clear:

 > A.6.  4.  From the list of undropped options, we generate a list of
 > pairwise defeats.  [ insert A.6.4.a and A.6.4.b ]

 > 5.  We construct the Schwartz set.  [ insert A.6.4.c ]

 > 6.  ... and return to step 5.

 > That should explain better what is happening.


	Like so?


Replace A.6 with:

   A.6 Vote Counting

     1. Each voter's ballot ranks the options being voted on.  Not all
        options need be ranked.  Ranked options are considered
        preferred to all unranked options.  Voters may rank options
        equally.  Unranked options are considered to be ranked equally
        with one another.  Details of how ballots may be filled out
        will be included in the Call For Votes.
     2. If the ballot has a quorum requirement R any options other
        than the default option which do not receive at least R votes
        ranking that option above the default option are dropped from
        consideration.
     3. Any (non-default) option which does not defeat the default option
        by its required majority ratio is dropped from consideration.
        a. Given two options A and B, V(A,B) is the number of voters
           who prefer option A over option B.
        b. An option A defeats the default option D by a majority
           ratio N, if V(A,D) is strictly greater than N * V(D,A).
        c. If a supermajority of S:1 is required for A, its majority ratio
           is S; otherwise, its majority ratio is 1.
     4. From the list of undropped options, we generate a list of
        pairwise defeats:
           a. An option A defeats an option B, if V(A,B) is strictly
              greater than V(B,A).
           b. An option A transitively defeats an option C if A
              defeats C or if there is some other option B where A
              defeats B AND B transitively defeats C.
     5.  We construct the Schwartz set from the list of pairwise
         defeats: An option A is in the Schwartz set if for all
         options B, either A transitively defeats B, or B does not
         transitively defeat A.

        If there are defeats between options in the Schwartz set, we
        drop the weakest such defeats from the list of pairwise
        defeats, and return to step 5.

           a. A defeat (A,X) is weaker than a defeat (B,Y) if V(A,X)
              is less than V(B,Y).  Also, (A,X) is weaker than (B,Y)
              if V(A,X) is equal to V(B,Y) and V(X,A) is greater than
              V(Y,B).
           b. A weakest defeat is a defeat that has no other defeat
              weaker than it.  There may be more than one such defeat.
     6. If there are no defeats within the Schwartz set, then the winner
        is chosen from the options in the Schwartz set.  If there is
        only one such option, it is the winner. If there are multiple
        options, the elector with the casting vote chooses which of those
        options wins.  

-- 
No matter how much money you spend, you can't make a racehorse out of
a pig.  You can, however, make an awfully fast pig.
Manoj Srivastava   <srivasta@debian.org>  <http://www.debian.org/%7Esrivasta/>
1024R/C7261095 print CB D9 F4 12 68 07 E4 05  CC 2D 27 12 1D F5 E8 6E
1024D/BF24424C print 4966 F272 D093 B493 410B  924B 21BA DABB BF24 424C



Reply to: