Proportional approval voting

Part of the Politics series
Electoral systems
show Plurality/majoritarian Plurality First-past-the-post Single non-transferable vote Limited voting Plurality-at-large (block voting) General ticket Multi-round voting Two-round Exhaustive ballot Ranked / preferential systems Instant-runoff (alternative vote) Contingent vote Coombs' method Condorcet methods (Copeland's, Dodgson's, Kemeny–Young, Minimax, Nanson's, ranked pairs, Schulze, Alternative Smith) Positional voting (Borda count, Nauru/Dowdall method) Bucklin voting Oklahoma primary electoral system Preferential block voting Cardinal / graded systems Score voting Approval voting (unified primary) Combined approval voting Usual judgment Satisfaction approval voting Majority judgment STAR voting
show Proportional representation Party-list (open lists, closed lists, local lists) Highest averages (D'Hondt, Sainte-Laguë, Huntington–Hill) Largest remainder (Hare, Droop, Imperiali, Hagenbach-Bischoff) Proportional forms of ranked voting Single transferable vote (Gregory, Wright) CPO-STV Schulze STV Proportional forms of approval voting Proportional approval voting Sequential proportional approval voting Biproportional apportionment Fair majority voting Weighted voting Direct representation Interactive representation Liquid democracy
show Mixed systems Non-compensatory mixed systems Parallel voting (mixed-member majoritarian) Compensatory mixed systems Mixed-member proportional Additional member system Mixed single vote (positive vote transfer) Scorporo (negative vote transfer) Alternative Vote Plus Dual-member proportional Rural–urban proportional Other mixed systems Majority bonus
show Other systems and related theory Cumulative voting Binomial voting Proxy voting Delegated voting Random selection (sortition, random ballot) Comparison of electoral systems Social choice theory Arrow's theorem Gibbard–Satterthwaite theorem Public choice theory
Politics portal
v t

Proportional approval voting (PAV) is an electoral system which is an extension of approval voting to multiple-winner elections. It applies proportional representation principles with a ballot which is no more complicated than ballots for plurality voting. It allows each voter to vote for as many or as few candidates as they choose. The system was invented by Thorvald N. Thiele.^[1][2][3] It was rediscovered by Forest Simmons in 2001,^[4] who coined the name "proportional approval voting".

Description[]

PAV works by looking at how "satisfied" each voter is with each potential result or outcome of the election. The calculated satisfaction with any particular result for an individual voter is a function of how many of the elected candidates the individual originally voted for.^[5] Under PAV, to calculate the satisfaction of an individual, only the elected candidates that the individual voted for are counted - the unsuccessful candidates that they voted for, as well as the elected candidates that they did not vote for are not taken into account. Assuming that an individual voted for n candidates that were successful, their satisfaction would be calculated using the formula^[4]

${\displaystyle 1+{\frac {1}{2}}+{\frac {1}{3}}+\cdots +{\frac {1}{n}}}$

Summing the satisfaction across all voters with any potential result gives the population's total satisfaction with that result. The total satisfaction is calculated for every possible set of candidates, and the set of candidates with the highest total satisfaction is deemed to be the winning set.

In an election with only one winner, PAV operates in exactly the same way as normal approval voting. If on the other hand, each voter voted exclusively for all of the candidates within a single party, PAV would function in the same way as the D'Hondt method of party-list proportional representation.

Computation[]

Computing the winners in PAV is NP-hard,^[6] making it a very computationally demanding voting method as the number of candidates and seats increase. If there were c candidates and s seats, then there would be

${\displaystyle {\binom {c}{s}}={\frac {c!}{s!(c-s)!}}}$

combinations of candidates to compare with each election,^[7] for example if there were 24 candidates for 4 seats, there would be 10,626 combinations to calculate total satisfaction for. An election requiring this many calculations would necessitate vote counting by computer.

Sequential proportional approval voting is a method that can be considered an approximation of PAV, and it can be computed in polynomial time.

Example[]

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

• 5: AB
• 17: AC
• 8: D

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

Andrea and Carter are elected.

Properties[]

Most systems of proportional representation use party lists. PAV was designed to have both proportional representation and personal votes (voters vote for candidates, not for a party list). It deserves to be called a "proportional" system because if votes turn out to follow a partisan scheme (each voter votes for all candidates from a party and no other) then the system elects a number of candidates in each party that is proportional to the number of voters who chose this party.^[8]

PAV satisfies the strong fairness property called extended justified representation. Moreover, it is the only weight-based approval voting rule that satisfies this property.^[9] Similarly, it is the only weight-based approval voting rule that satisfies proportional justified representation.^[10]

References[]