# Proportional approval voting

**Proportional approval voting** (PAV) is a theoretical voting system for multiple-winner elections, in which each voter can vote for as many or as few candidates as the voter chooses. It was developed by Forest Simmons in 2001.

PAV works by looking at how "satisfied" each voter is with each potential result or outcome of the of the election.
The satisfaction for individual voters of a potential result is calculated based on how many of the successful candidates they voted for. In this particular system, if an individual voted for *n* successful candidates (and an irrelevant number of unsuccessful ones) then their satisfaction is taken to be

Adding up the satisfaction of all the voters with the potential result gives the total satisfaction with that result. The potential result with the highest total satisfaction is chosen as the actual result.

If there was only one winner then *proportional approval voting* would become simple *approval voting*. Alternatively, if each voter only voted for all the candidates of a single party then the results would essentially be the same as the D'Hondt method of *party-list proportional representation*.

Without the weighting of satisfaction, i.e. if the numbers of votes for each candidate are simply added up and those with the highest numbers elected, equivalent to satisfaction being *n*, then this would amount to *block approval voting* which could have a similar chance of landslide results as *block voting*.

*Proportional approval voting* is a computationally complex method of vote counting. If there were *c* candidates and *w* winners, then there would be

potential results to compare with each vote. If there were 20 candidates for 5 seats then there would be more than 15,000 potential results. Such elections could only reasonably be counted by computer.

A somewhat simpler counting method is **sequential proportional approval voting** where candidates are elected one-by-one to the winners' circle by approval voting, but in each round the value of the votes of each voter who already has *m* candidates in the winners' circle is reduced to

This was developed by the Danish polymath Thorvald N. Thiele, and used (with adaptations) in Sweden for a short period after 1909.

The system disadvantages minority groups who share some preferences with the majority. In terms of tactical voting, it is therefore highly desirable to withhold approval from candidates who are likely to be elected in any case, as with cumulative voting and the single non-transferable vote.

## Example[edit | edit source]

2 seats to be filled, four candidates: Andrea (A), Brad (B), Carter (C), and Delilah (D). The ballots are:

- 5: AB
- 17: AC
- 8: D

There are 6 possible results: AB, AC, AD, BC, BD, and CD.

AB | AC | AD | BC | BD | CD | |
---|---|---|---|---|---|---|

voters approving 2 successful candidates (satisfaction of 1 1/2) | 5 | 17 | 0 | 0 | 0 | 0 |

voters approving 1 successful candidate (satisfaction of 1) | 17 | 5 | 30 | 22 | 13 | 25 |

voters approving no successful candidates (satisfaction of 0) | 8 | 8 | 0 | 8 | 17 | 5 |

total satisfaction | 24.5 | 30.5 |
30 | 22 | 13 | 25 |

Andrea and Carter are elected.

## Similar Systems[edit | edit source]

Both the Phragmén's Method and Sequential Proportional Approval Voting are very similar systems invented in the early 1900s. Reweighted Range Voting is the extension of this concept to Score Voting. These systems all derive their reweigting theory as the natural extension of the Jefferson Method to Multi-Member Systems.

This page uses Creative Commons Licensed content from Wikipedia (view authors). |