April 23rd Draft
Hi, I have incorporated Rauls latest efforts on A.6. Jochen, do you still think we need to edit A.6.8 for clarity? manoj __ DRAFT: __ Under 4.2 Procedure [for developers during a general resolution or election], change item 3 to read: 3. Votes are taken by the Project Secretary. Votes, tallies, and results are not revealed during the voting period; after the vote the Project Secretary lists all the votes cast. The voting period is 2 weeks, but may be varied by up to 1 week by the Project Leader, and may be ended by the Project Secretary when the outcome is no longer in doubt. In this context, we ignore the possibility that people might want to change their vote. __ Under 5.2 Appointment of project leader, change item 7 to read: 7. The decision will be made using the method specified in section A.6 of the Standard Resolution Procedure. The quorum is the same as for a General Resolution (s.4.2) and the default option is None Of The Above. __ Under 6.1 Powers [of the technical committee], change item 7 to read: 7. Appoint the Chairman of the Technical Committee. The Chairman is elected by the Committee from its members. All members of the committee are automatically nominated; the committee votes starting one week before the post will become vacant (or immediately, if it is already too late). The members may vote by public acclamation for any fellow committee member, including themselves; there is no default option. The vote finishes when all the members have voted or when the outcome is no longer in doubt. The result is determined using the method specified in section A.6 of the Standard Resolution Procedure. __ Under A.2 Calling for a vote, change items 2 and 4 to read 2. The proposer or any sponsor of a resolution may call for a vote on that resolution and all related amendments. 4. The minimum discussion period is counted from the time the last formal amendment was accepted, or since the whole resolution was proposed if no amendments have been proposed and accepted. __ Replace A.3 with: A.3. Voting procedure 1. Each resolution and its related amendments is voted on in a single ballot that includes an option for the original resolution, each amendment, and the default option (where applicable). 2. The default option must not have any supermajority requirements. Options which do not have an explicit supermajority requirement have a 1:1 majority requirement. 3. The votes are counted according to the the rules in A.6. The default option is Further Discussion, unless specified otherwise. 4. In cases of doubt the Project Secretary shall decide on matters of procedure. __ Replace A.5 with: A.5. Expiry If a proposed resolution has not been discussed, amended, voted on or otherwise dealt with for 4 weeks the secretary may issue a statement that the issue is being withdrawn. If none of the sponsors of any of the proposals object within a week, the issue is withdrawn. The secretary may also include suggestions on how to proceed, if appropriate. __ 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
Re: April 23rd Draft
On Wed, Apr 23, 2003 at 12:45:46AM -0500, Manoj Srivastava wrote: I have incorporated Rauls latest efforts on A.6. Jochen, do you still think we need to edit A.6.8 for clarity? I don't think this is any better than the previous drafts. A.6 Vote Counting 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). 5. From the list of [undropped] pairwise defeats, we generate a set of transitive defeats. a. 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. 6. We construct the Schwartz set from the set of transitive defeats. a. 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. 7. 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. 8. 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. Since we're saying undropped defeats (5, eg) explicitly in some cases, it'd seem logical to assume that when we don't say it, we're talking about all the defeats, which is wrong and stupid, but won't stop people from assuming it anyway. If you want to make it obvious and programmatic, how about: 4. From the list of undropped options, we generate a list of defeats. a. A pair of undropped options (A,B) is in the list of defeats if V(A,B) is strictly greater than V(B,A). 5. We construct the Schwartz set from the set of transitive defeats. a. An option A transitively defeats an option C if (A,C) is in the list of defeats, or if there is some option B, such that (A,B) is in the list of defeats and B transitively defeats C. b. An undropped option S is in the Schwartz set if for all options X, either S transitively defeats X, or X does not transitively defeat S. 6. If there are defeats between any options in the Schwartz set, we remove all the weakest such defeats from the list of defeats, defeats, and return to step 5. a. There is a defeat between options A and B, both in the Schwartz set, if either (A,B) or (B,A) is in the list of defeats. b. 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). c. A weakest defeat is a defeat that has no other defeat weaker than it. There may be more than one such defeat. 7. If there are no defeats between any options in 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. ? Cheers, aj -- Anthony Towns [EMAIL PROTECTED] http://azure.humbug.org.au/~aj/ I don't speak for anyone save myself. GPG signed mail preferred. ``Dear Anthony Towns: [...] Congratulations -- you are now certified as a Red Hat Certified Engineer!'' pgp2IzyiVCoNU.pgp Description: PGP signature
Re: April 23rd Draft
On Wed, 23 Apr 2003 16:36:00 +1000, Anthony Towns aj@azure.humbug.org.au said: On Wed, Apr 23, 2003 at 12:45:46AM -0500, Manoj Srivastava wrote: I have incorporated Rauls latest efforts on A.6. Jochen, do you still think we need to edit A.6.8 for clarity? I don't think this is any better than the previous drafts. Since we're saying undropped defeats (5, eg) explicitly in some cases, it'd seem logical to assume that when we don't say it, we're talking about all the defeats, which is wrong and stupid, but won't stop people from assuming it anyway. If you want to make it obvious and programmatic, how about: A.6 Vote Counting 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). 4. From the list of undropped options, we generate a list of defeats. a. A pair of undropped options (A,B) is in the list of defeats if V(A,B) is strictly greater than V(B,A). Umm. Now you lost poor simple folks like me. The first wording tells me about defeats -- a term I can understand. The second set, by itself, is somewhat more complex. Secondly, you imply that a pair of options is in the list of defeats -- which is even more confusing. Is it a list of defeats, or a list of options? I think you mean that (A,B) represents a defeat -- perhaps: 4. From the list of undropped options, we generate a list of pairwise defeats. a) For a pair of undropped options A nd B, a defeat D(A,B) is in this list of defeats if V(A,B) is strictly greater than V(B,A). 5. From the list of [undropped] pairwise defeats, we generate a set of transitive defeats. a. 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. 6. We construct the Schwartz set from the set of transitive defeats. a. 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. 5. We construct the Schwartz set from the set of transitive defeats. a. An option A transitively defeats an option C if (A,C) is in the list of defeats, or if there is some option B, such that (A,B) is in the list of defeats and B transitively defeats C. b. An undropped option S is in the Schwartz set if for all options X, either S transitively defeats X, or X does not transitively defeat S. Hmm. I guess I agree with qualifying the options as _undropped_ options here. Again, adding the nomenclature for a defeat: a. An option A transitively defeats an option C if D(A,C) is in the list of defeats, or if there is some option B, such that D(A,B) is in the list of defeats and B transitively defeats C. 7. 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 defeats between any options in the Schwartz set, we remove all the weakest such defeats from the list of defeats, defeats, and return to step 5. a. There is a defeat between options A and B, both in the Schwartz set, if either (A,B) or (B,A) is in the list of defeats. D(A,B) D(B,A) b. A defeat (A,X) is weaker than a defeat (B,Y) if V(A,X) is D(A,X)D(B,Y) less than V(B,Y). Also, (A,X) is weaker than (B,Y) if D(A,X) D(B,Y) V(A,X) is equal to V(B,Y) and V(X,A) is greater than V(Y,B). c. A weakest defeat is a defeat that has no other defeat weaker than it. There may be more than one such defeat. 7. If there are no defeats between any options in 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. I do like the second version better. manoj -- So so is good, very good, very excellent good: and yet it is not; it is but so so. William Shakespeare, As You Like It Manoj Srivastava [EMAIL PROTECTED] 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
