[spoon-discuss] Re: [Spoon-business] Standard Elections: a full proposal

[Zarpint Jeremy Cook <mcfoufou@xxxxxxxxx>]

How does this rule affect the Minister Elections we currently have?
It looks to me like they're in conflict with this.
What's wrong with it there that we need this rule? And we need
more counting methods than the Borda count. And why is the Borda count
the default, anyway? I like the Hare system, where the candidate with the
lowest vote count gets eliminated, and the votes get transferred to the
second choice.

Zarpint


On Fri, 16 Jan 2004, Daniel Lepage wrote:

> I amend my proposal entitled "Standard Election Procedure" to read:
> {{
> __Standardized Elections__
>
> Create a rule:
> {{
> __Standard Election Procedure__
>
> An Election is a type of event used to make a decision. An Election has
> four primary attributes: a list of Eligible Voters, a Duration, a
> Selection Algorithm, and a list of choices.
>
> The Eligible Voters set is the set of all Game Objects who are allowed
> to cast votes in the Election.
> Each Eligible Voter may cast a single vote in the Election. If a Voter
> submits more than one vote, the *last* one submitted is their actual
> vote (so votes can be changed by resubmitting them). The Duration of a
> Election is an amount of time signifying how long voting will continue.
> When the Duration of the Election Concludes, a single choice from the
> list of choices is selected using the Selection Algorithm.
>
> A Selection Method is a means of choosing one of many choices through
> votes. A method is a valid Selection Method if and only if it specifies
> A) what constitutes a legal vote, and B) how to determine a winner
> based on legally cast votes.
>
> Only Selection Methods defined by the rules may be used in Elections.
>
> Elections are only called when specified by the rules. If a Election is
> called, but no list of Eligible Voters is specified for it, it is
> assumed that all Players are Eligible Voters, and nothing else is. If a
> Election is called, but no Duration is specified, it is assumed that
> the Duration is until the end of the current nweek.
>
>
> A. Types of Durations
>
> The Duration of a Election may be any of the following:
> * An absolute point in ntime, such as "nweek 212, nday 6". In this
> case, the Duration Concludes at that point in ntime, or, if it has not
> elapsed but that time has already passed, immediately.
> * A relative point in ntime, such as "three ndays from the calling of
> the Election". In this case, the Duration Concludes at the end of the
> specified period. A Election, where is a unit of ntime, is a Election
> with as its Duration (for example, a 3-nday Election)
> * Either of the above, with a point/amount in real time/wtime
> substituted for the point in ntime. This use is strongly discouraged
> except in cases where ntime would be unsuitable.
> * Indeterminate. An Indeterminate Duration does not Conclude based on
> time. Indeterminate Elections should generally be Short-Circuited (see
> below), but don't have to be...
>
> B. Special Elections
>
> A Election may have any of the following optional flags:
> * Short-Circuited: The Duration of a Short-Circuited Election Concludes
> as soon as every Eligible Voter has cast a vote.
> * Very Badly Wired (VBW): A VBW Election's Duration Concludes as soon
> as enough Eligible Voters have cast votes that the outcome of the
> Election could not be changed by the votes cast by the rest of the
> Voters.
> * Strict: In a Strict Election, each Voter gets exactly one Vote; this
> sentence takes precedence over any rule that would allow players to
> cast multiple votes on a Election.
> * Concealable: In a Concealable Election, votes may be sent to the
> Administrator privately; when the Duration Concludes, the administrator
> must post publicly the private votes.
>
> C. Selection Methods
>
> C.1. Borda Count
>
> The Borda Count is a Selection Method. In an election using a Borda
> Count, a legal vote consists of a list of all the choices, numbered one
> to n (where n is the number of choices), listed in the order of the
> Voter's choosing (so each Voter chooses one choice for First Place, one
> for Second, etc.).
>
> The approval rating of a choice in this case is xn-m, where x is the
> number of votes cast, n is the number of choices in the Election, and m
> is the sum of the ranks it received in all Voter's votes. [[ This is
> equivalent to giving each choice n points every time it was voted
> first, n-1 every time it was voted second, etc. ]]
>
> When a choice needs to be selected, a Choice Pool is made. The Choice
> Pool is intially the set of all choices.
>
> The following removals are then made from the Choice Pool, until only
> one choice remains; that choice is then selected. At each step, only
> those choices left in the Pool are considered.
>
> First, every choice that had a lower approval rating than any other
> choice is removed.
> Then, every choice that received fewer votes for First Place than any
> other choice is removed.
> Then the same is done for second place, then third, etc., until every
> place has been considered.
> If, after all of this, the Choice Pool still contains more than one
> choice, a choice is selected at random from the Choice Pool.
>
> If the Selection Method of an election is not specified, it is assumed
> to be using the Borda Count.
>
> }}
>
> Create another rule:
> {{
> __Personnel Elections__
>
> A Personnel Election is an Election preceded by a Nomination.
>
> The Nomination consists of a set of Nominables and a Duration. The set
> of Nominables is a list of game Objects. The Duration is a Duration as
> defined in the context of Elections.
>
> After a Nomination begins but before its Duration Concludes, players
> may nominate candidates from within the set of Nominables. All
> nominated objects become Candidates.
>
> When the Nomination's Duration Concludes, the Election begins, where
> the set of choices is the set of all Candidates from the Nomination.
>
> }}
> }}
>
> --
> Wonko
> Award Wonko a Win.
> -----[[BEGIN GEEK CODE BLOCK]}-----
> Version: 3.1
> GU/O d-(++)(?) s+:+ a--->+++ C++>++++>$ UB+>++++ P--@ L+>+++ E>++
> W++(+++) N+{((++]]}}) o?>++++ K? w------- O? M++ V- PS@ PE-@ Y-- PGP-
> t+ 5 X R+ tv--@ b+++@ DI++++ D G++ e*>++++ !h r++ y?
> ------END GEEK CODE BLOCK------
>
> _______________________________________________
> spoon-business mailing list
> spoon-business@xxxxxxxxx
> http://lists.ellipsis.cx/mailman/listinfo/spoon-business
>

-- 
Zarpint            "All thy toiling only breeds new dreams, new dreams;
Jeremy Cook         there is no truth saving in thine own heart."
mcfoufou@xxxxxxxxx       --W.B. Yeats, The Song of the Happy Shepherd
grep -r kibo /     "Movements are the problem, not the answer to problems."
_______________________________________________
spoon-discuss mailing list
spoon-discuss@xxxxxxxxx
http://lists.ellipsis.cx/mailman/listinfo/spoon-discuss