Sequential proportional approval voting (SPAV) or reweighted approval voting (RAV)[1] is an electoral system that extends the concept of approval voting to a multiple winner election. It is a simplified version of proportional approval voting. It is a special case of Thiele's voting rules, proposed by Danish statistician Thorvald N. Thiele in the early 1900s.[2] It was used (with adaptations for party lists) in Sweden from 1909-1921, when it was replaced by a cruder "party-list" style system as it was easier to calculate,[3] [4] and is still used for some local elections.
Sequential Proportional Approval Voting (SPAV) uses Approval Voting ballots to elect multiple winners equitably by selecting a candidate in each round and then reweighing the approvals for the subsequent rounds.[5]
Each ballot is assigned a value equal to the reciprocal of one more than the number of candidates approved on that ballot who have been designated as elected. Each ballot is counted at its current value as a vote for all continuing candidates approved on that ballot. The candidate with the most votes in the round is elected. The process continues until the number of elected candidates is equal to the number of seats to be filled.[6]
At each stage, the unelected candidate with the highest approval score is elected. Then the value of each voter’s ballot is set at
| 1 | |
| s+1 |
There is an incentive towards tactical voting where a voter may withhold approval from candidates who are likely to be elected in any case, as with cumulative voting and the single non-transferable vote.
It is a much computationally simpler algorithm than harmonic proportional approval voting, permitting votes to be counted either by hand or by computer, rather than requiring a computer to determine the outcome of all but the simplest elections.[7]
When comparing Sequential Proportional Approval Voting to Single Transferable Vote, SPAV is better at selecting more central candidates, that represent all the voters, where STV is better at mimicking the distribution of the voters.[8]
For this example, there is an election for a committee with 3 winners. There are six candidates from two main parties: A, B, and C from one party, and X, Y, and Z from another party. About 2/3 of the voters support the first party, and the other roughly 1/3 of the voters support the second party. Each voter casts their vote by selecting the candidates they support. The following table shows the results of the votes. Each row starts by saying how many voters voted in that way and marks each candidate that group of voters supported. The bottom row shows the number of votes each candidate received.
| Candidate A | Candidate B | Candidate C | Candidate X | Candidate Y | Candidate Z | |
|---|---|---|---|---|---|---|---|
| 112 | ✓ | ✓ | ✓ | ||||
| 6 | ✓ | ✓ | |||||
| 4 | ✓ | ✓ | ✓ | ✓ | |||
| 73 | ✓ | ✓ | ✓ | ||||
| 4 | ✓ | ✓ | ✓ | ✓ | |||
| 1 | ✓ | ✓ | |||||
| Total Votes | 116 | 122 | 126 | 82 | 78 | 77 |
Because Candidate C has the most support, they are the first winner, w1, and their vote is not counted in later rounds. For the second round, anyone who voted for Candidate C has their vote counted as only 1/2. Below is the chart for round 2. A second column on the left has been added to indicate the weight of each ballot.
| Weight of Vote | Candidate A | Candidate B | Candidate C | Candidate X | Candidate Y | Candidate Z | |
|---|---|---|---|---|---|---|---|---|
| 112 | 1/2 | ✓ | ✓ | ✓ | ||||
| 6 | 1/2 | ✓ | ✓ | |||||
| 4 | 1/2 | ✓ | ✓ | ✓ | ✓ | |||
| 73 | 1 | ✓ | ✓ | ✓ | ||||
| 4 | 1/2 | ✓ | ✓ | ✓ | ✓ | |||
| 1 | 1 | ✓ | ✓ | |||||
| Weighted Votes | 58 | 61 | 78 | 76 | 75 |
Despite Candidates A and B having so many votes in the first round, Candidate X is the second winner, w2, because not as many of the votes for Candidate X were halved. In round 3, anyone who voted for either Candidates C or X has their vote count 1/2, and anyone who voted for both has their vote count 1/3. If anyone had voted for neither, their vote would remain at 1. Below is that table.
| Weight of Vote | Candidate A | Candidate B | Candidate C | Candidate X | Candidate Y | Candidate Z | |
|---|---|---|---|---|---|---|---|---|
| 112 | 1/2 | ✓ | ✓ | ✓ | ||||
| 6 | 1/2 | ✓ | ✓ | |||||
| 4 | 1/3 | ✓ | ✓ | ✓ | ✓ | |||
| 73 | 1/2 | ✓ | ✓ | ✓ | ||||
| 4 | 1/3 | ✓ | ✓ | ✓ | ✓ | |||
| 1 | 1/2 | ✓ | ✓ | |||||
| Weighted Votes | 57 1/3 | 60 1/3 | 38 1/3 | 37 5/6 |
Candidate B is the third and final winner, w3. The final result has 2/3 winners from the party that had about 2/3 of the votes, and 1/3 winner from the party that had about 1/3 of the votes. If approval voting had been used instead, the final committee would be all three candidates from the first party, as they had the highest three vote totals without scaling.
Sequential-PAV satisfies the fairness property called justified representation whenever the committee size is at most 5, but might violate it when the committee size is at least 6.[9] [10]
SPAV is not precinct summable, and requires the ballot information to be centralized before a complete winner set can be determined.
| Pareto efficiency | Committee monotonicity | Support monotonicity with additional voters | Support monotonicity without additional voters | Consistency | inclusion- strategyproofness | Computational complexity | ||
|---|---|---|---|---|---|---|---|---|
| Approval voting | strong | ✓ | ✓ | ✓ | ✓ | ✓ | P | |
| Proportional approval voting | strong | × | ✓ | cand | ✓ | × | NP-hard | |
| Sequential Proportional Approval Voting | × | ✓ | cand | cand | × | × | P |