[EM] Lowest YES p.r. elimination method

[DEMOREP1 at aol.com]

Yet another simple p.r. elimination method would be a lowest YES elimination 
(combining parts of a YES/NO table and a Place Votes table).

Voters vote YES on desired choices and use Number Votes (1, 2, etc.).

A choice with first place votes that equal or exceed a Hare Quota (total 
votes/ total seats) is elected.

The choice with the lowest number of YES choices loses. The lower choices on 
the ballots involved move up.  Repeat until N choices remain (who are 
elected). 

A variable sized body might have any choice getting at least X percent of the 
first place votes being elected.  

As usual, each winner should have a voting power in the legislative body 
equal to the number of votes he/she receives.

Example- Elect 5 legislators in a district

     First Place Votes
         
A  15
B  13
C  14
D  21
E  14 + 1 = 15
F  11 + 3 = 14
G    5 + 3 =   8
H    7 - 7  =  0

100

H has the lowest YES votes and loses.  Note-- a loser may have more first 
place votes than another choice.

A  15 + 5 = 20
B  13 -13 =  0
C  14 + 8 = 22
D  21
E  15
F  14
G    8

100

B now has the lowest YES votes and loses.

A  20
C  22
D  21
E  15 + 3 = 18
F  14 + 5 = 19
G    8 - 8 =  0

100

G now has the lowest YES votes and loses.

The above could be used also for single/ multiple winner elections for 
executive and judicial offices (especially if there was no majority YES 
choice(s) and it is not desired that the legislative body involved fill the 
vacancy - noting also that any such single winner(s) might have governing 
problems if he/she/they lacked a YES majority).  

For M multiple winners (such as 2 judges), the earliest M places would be 
added-
       Place Votes
         1     2

J      35   17
K      14   40

As usual-- since Head to Head is NOT done in the above (greatly adding some 
complexity), it is technically defective.