# Elections

1. Ballots shall list all candidates in alphabetical order. Each voter votes by placing a "1" opposite his/her first choice, "2" opposite his/her second choice, and so on, stopping at any point.
2. If there are $$k$$ (unspoiled) ballots and $$n$$ positions to be filled, then the quota is defined to be $$q = k/n+1$$.
3. Each ballot is given a weight, $$w$$. Initially, $$w=1$$ for all ballots.
4. The score of a candidate is the sum of the weights of the ballots.
5. If a candidate has a score $$s > q$$, he/she is declared elected, except in case the number of candidates elected would exceed $$n$$. In this case, there should be a runoff as in step 6 among those candidates selected on this last count. The weight of each ballot on which that candidate was next available preference is multiplied by $$(s - q)/s$$ to give it a new weight.
1. If no candidate has a score $$s > q$$, then the candidate with lowest score, if unique, is eliminated from all ballots. A tie for lowest score is broken by a runoff scoring among the tied candidates using all ballots.
2. If this fails to break the tie, one of the tied candidates is eliminated by a method to be determined by the Head.
6. After step 5 has been completed for all candidates, or after step 6, the names of those candidates either elected or eliminated are struck off all ballots, and steps 4 - 6 are repeated.
1. If at any time the number of available candidates is equal to the number of positions remaining unfilled, these remaining candidates are declared elected, and the process ends.
2. If at any time the number of candidates whose score is greater than $$k/n+1$$ is equal to the number of positions, these candidates are declared elected, and the process ends.