Proportional approval voting

For an overview of proportional variants of approval voting, see multiwinner approval voting.

Not to be confused with sequential proportional approval voting, an approximation algorithm for proportional approval voting.

Proportional approval voting (PAV) is a proportional electoral system for multiwinner elections. It is a multiwinner approval method that extends the D'Hondt method of apportionment commonly used to calculate apportionments for party-list proportional representation. ^[1] However, PAV allows voters to support only the candidates they approve of, rather than being forced to approve or reject all candidates on a given party list. ^[2]

In PAV, voters cast approval ballots marking all candidates they approve of; each voter's ballot is then treated as if all candidates on the ballot were on their own "party list." Seats are then apportioned between candidates in a way that ensures all coalitions are represented proportionally.

History

PAV is a special case of Thiele's voting rule, proposed by Thorvald N. Thiele. ^{[3] [4]} It was used in combination with ranked voting in the Swedish elections from 1909 to 1921 for distributing seats within parties and in local elections. ^[4] PAV was rediscovered by Forest Simmons in 2001, ^[5] who gave it the name "proportional approval voting."

Method

See also: Highest averages method

Like its close cousin, satisfaction approval voting, PAV can be thought of as selecting a committee by testing all possible committees, then choosing the committee with the most votes. In satisfaction approval voting, each voter's ballot is split equally between all ${\displaystyle r}$ candidates they approve of, giving each one ${\displaystyle 1/r}$ votes. If voters are perfectly strategic, and only support as many candidates as their party is entitled to, SAV creates a proportional result.

PAV makes one modification to remove this need for strategy: it only splits a voter's ballot after they have elected a candidate. As a result, voters can freely approve of losing candidates without diluting their ballot. Voters contribute a whole vote to the first candidate they support who is elected; half a vote to the second candidate; and so on.

Thus, of a ballot approves of ${\displaystyle r}$ candidates who are elected, that ballot contributes the ${\displaystyle r}$-th harmonic number to that committee's vote total. In other words: ^{[5] [6]}

${\displaystyle \mathrm {H} (r)=1+{\frac {1}{2}}+{\frac {1}{3}}+\cdots +{\frac {1}{r}}}$

The score for a given committee is calculated as the sum of the scores garnered from all the voters. We then choose the committee with the highest score.

Formally, assume we have a set of candidates ${\displaystyle C=\{c_{1},c_{2},\ldots ,c_{m}\}}$, a set of voters ${\displaystyle N=\{1,2,\ldots ,n\}}$, and a committee size ${\displaystyle k}$. Let ${\displaystyle A_{i}}$ denote the set of candidates approved by voter ${\displaystyle i\in N}$. The PAV score of a committee ${\displaystyle W\subseteq C}$ with size ${\displaystyle |W|=k}$ is defined as ${\displaystyle \textstyle \mathrm {sc} _{\mathrm {PAV} }(W)=\sum _{i=1}^{n}\mathrm {H} (|A_{i}\cap W|)}$. PAV selects the committee ${\displaystyle W}$ with the maximal score.

Example 1

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

• 5 voters voted for A and B
• 17 voters voted for A and C
• 8 voters voted for D

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

	AB	AC	AD	BC	BD	CD
score from the 5 voters voting for AB	${\displaystyle 5\cdot \left(1+{\tfrac {1}{2}}\right)=7.5}$	${\displaystyle 5\cdot 1=5}$	${\displaystyle 5\cdot 1=5}$	${\displaystyle 5\cdot 1=5}$	${\displaystyle 5\cdot 1=5}$	${\displaystyle 5\cdot 0=0}$
score from the 17 voters voting for AC	${\displaystyle 17\cdot 1=17}$	${\displaystyle 17\cdot \left(1+{\tfrac {1}{2}}\right)=25.5}$	${\displaystyle 17\cdot 1=17}$	${\displaystyle 17\cdot 1=17}$	${\displaystyle 17\cdot 0=0}$	${\displaystyle 17\cdot 1=17}$
score from the 8 voters voting for D	${\displaystyle 8\cdot 0=0}$	${\displaystyle 8\cdot 0=0}$	${\displaystyle 8\cdot 1=8}$	${\displaystyle 8\cdot 0=0}$	${\displaystyle 8\cdot 1=8}$	${\displaystyle 8\cdot 1=8}$
Total score	24.5	30.5	30	22	13	25

Andrea and Carter are elected.

Note that Simple Approval shows that Andrea has 22 votes, Carter has 17 votes, Delilah has 8 votes and Brad has 5 votes. In this case, the PAV selection of Andrea and Carter is coincident with the Simple Approval sequence. However, if the above votes are changed slightly so that A and C receive 16 votes and D receives 9 votes, then Andrea and Delilah are elected since the A and C score is now 29 while the A and D score remains at 30. Also, the sequence created by using Simple Approval remains unchanged. This shows that PAV can give results that are incompatible with the method which simply follows the sequence implied by Simple Approval.

Example 2

Assume there are 10 seats to be selected, and there are three groups of candidates: red, blue, and green candidates. There are 100 voters:

• 60 voters voted for all blue candidates,
• 30 voters voted for all red candidates,
• 10 voters voted for all green candidates.

In this case PAV would select 6 blue, 3 red, and 1 green candidate. The score of such a committee would be$${\displaystyle 60\cdot \mathrm {H} (6)+30\cdot \mathrm {H} (3)+10\cdot \mathrm {H} (1)=60\cdot \left(1+{\tfrac {1}{2}}+\ldots +{\tfrac {1}{6}}\right)+30\cdot \left(1+{\tfrac {1}{2}}+{\tfrac {1}{3}}\right)+10\cdot 1=147+55+10=212{\text{.}}}$$All other committees receive a lower score. For example, the score of a committee that consists of only blue candidates would be

${\displaystyle 60\cdot \mathrm {H} (10)+30\cdot \mathrm {H} (0)+10\cdot \mathrm {H} (0)=60\cdot \left(1+{\tfrac {1}{2}}+\ldots +{\tfrac {1}{10}}\right)\approx 175.73{\text{.}}}$

In this example, the outcome of PAV is proportional: the number of candidates selected from each group is proportional to the number of voters voting for the group. This is not coincidence: If the candidates form disjoint groups, as in the above example (the groups can be viewed as political parties), and each voter votes exclusively for all of the candidates within a single group, then PAV will act in the same way as the D'Hondt method of party-list proportional representation. ^[1]

Properties

This section describes axiomatic properties of Proportional Approval Voting.

Committees of size one

In an election with only one winner, PAV operates in exactly the same way as approval voting. That is, it selects the committee consisting of the candidate who is approved by the most voters.

Proportionality

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 (see Example 2). ^[1] Further, under mild assumptions (symmetry, continuity and Pareto efficiency), PAV is the only extension of the D'Hondt method that allows personal votes and satisfies the consistency criterion. ^[2]

Even if the voters do not follow the partisan scheme, the rule provides proportionality guarantees. For example, PAV satisfies the strong fairness property called extended justified representation, ^[6] as well as the related property proportional justified representation. ^[7] It also has optimal proportionality degree. ^{[8] [9]} All these properties guarantee that any group of voters with cohesive (similar) preferences will be represented by a number of candidates that is at least proportional to the size of the group. PAV is the only method satisfying such properties among all PAV-like optimization methods (that may use numbers other than harmonic numbers in their definition). ^[6]

The committees returned by PAV might not be in the core.^{[ jargon ] [6] [10]} However, it guarantees 2-approximation of the core,^{[ jargon ]} which is the optimal approximation ratio that can be achieved by a rule satisfying the Pigou–Dalton principle of transfers. ^[10] Furthermore, PAV satisfies the property of the core if there are sufficiently many similar candidates running in an election. ^[11]

PAV fails priceability (that is, the choice of PAV cannot be always explained via a process where the voters are endowed with a fixed amount of virtual money, and spend this spend money on buying candidates they like) and fails laminar proportionality. ^[10] Two alternative rules that satisfy priceability and laminar proportionality, and that have comparably good proportionality-related properties to PAV are the method of equal shares and Phragmén's sequential rules. ^[12] These two alternative methods are also computable in polynomial time, yet they fail Pareto efficiency.

Other properties

Apart from properties pertaining to proportionality, PAV satisfies the following axioms:

• Pareto efficiency
• Consistency
• Support monotonicity (if the support of a winning candidate increases, i.e., more voters vote for this candidate, then this candidate remains winning) ^[13]
• Pigou–Dalton principle ^[10]

PAV fails the following properties:

• House monotonicity. ^[12] Two alternative methods that satisfy house monotonicity and that have comparably good proportionality-related properties to PAV are Sequential Proportional Approval Voting and Phragmén's Sequential Rules. ^[12] These two alternative methods are also computable in polynomial time, but they fail Pareto efficiency, Consistency, and the Pigou–Dalton principle. ^[12]

Computation

An integer linear programming formulation for computing winning committees according to PAV. The variable ${\displaystyle y_{c}}$ indicates whether candidate ${\displaystyle c}$ is selected or not. The variable ${\displaystyle x_{i,\ell }}$ indicates whether voter ${\displaystyle i}$ approves at least ${\displaystyle \ell }$ selected candidates.

PAV solutions and their quality can be verified in polynomial-time, ^{[15] [16]} making transparency easy. However, the worst-case time complexity is NP-complete, meaning that for some elections it can be difficult or impossible to find an exact solution that guarantees all the theoretical properties of PAV.

In practice, the outcome of PAV can be computed exactly for medium-sized committees (<50 candidates) using integer programming solvers (such as those provided in the abcvoting Python package). Finding an exact solution has time complexity ${\displaystyle O(nm^{k})}$ with k seats and n voters.

From the perspective of parameterized complexity, the problem of computing PAV is theoretically difficult outside of a few exceptional easy cases. ^{[15] [17] [18]} Luckily, such cases are often good approximations of real elections, allowing them to be used as heuristics that dramatically reduce the computational effort of finding a correct solution. For example, exact election results can be solved in polynomial time in the case where voters and candidates lie along a single-dimensional political spectrum, ^[14] and in linear time when voters are strong partisans (i.e. vote for party lists instead of candidates).

Deterministic approximations

Approximation algorithms can find "good-enough" solutions very quickly in practice. Sequential proportional approval voting modifies PAV, using a greedy algorithm to approximate the result. SPAV has a worst-case approximation ratio of ${\displaystyle 1-1/e\approx 0.63}$, so the PAV score of the resulting committee is at least 63% of the optimal. ^[16] This method can be computed in polynomial time, and the election outcome could potentially be determined by hand. A different approach including derandomized rounding (with the method of conditional probabilities) gives a worst-case approximation ratio of 0.7965; ^[19] under standard assumptions in complexity theory, this is the best approximation ratio that can be achieved for PAV in polynomial time. ^[19] The problem of approximating PAV can be also formulated as a minimization problem (instead of maximizing ${\displaystyle \textstyle \mathrm {sc} _{\mathrm {PAV} }(W)}$ we want to minimize ${\displaystyle \textstyle \sum _{i\in N}\mathrm {H} (k)-\mathrm {sc} _{\mathrm {PAV} }(W)}$), in which case the best known approximation ratio is 2.36. ^[20]

Further reading

• Lackner, Martin; Skowron, Piotr (2023). Multi-Winner Voting with Approval Preferences. SpringerBriefs in Intelligent Systems. arXiv: 2007.01795 . doi:10.1007/978-3-031-09016-5. ISBN   978-3-031-09015-8. S2CID   244921148.
• Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Nimrod Talmon (2017-10-26). "Multiwinner Voting: A New Challenge for Social Choice Theory". In Endriss, Ulle (ed.). Trends in Computational Social Choice. AI Access. ISBN   978-1-326-91209-3.

See also

• Method of equal shares
• D'Hondt method
• Sequential proportional approval voting
• Phragmen's voting rules

References

1. Brill, Markus; Laslier, Jean-François; Skowron, Piotr (2018). "Multiwinner Approval Rules as Apportionment Methods". Journal of Theoretical Politics. 30 (3): 358–382. arXiv: 1611.08691 . doi:10.1177/0951629818775518. S2CID   10535322.
2. Lackner, Martin; Skowron, Piotr (2021). "Consistent approval-based multi-winner rules". Journal of Economic Theory. 192: 105173. arXiv: 1704.02453 . doi:10.1016/j.jet.2020.105173. S2CID   232116881.
3. Thiele, Thorvald N. (1895). "Om Flerfoldsvalg". Oversigt over Det Kongelige Danske Videnskabernes Selskabs Forhandlinger: 415–441.
4. Janson, Svante (2016). "Phragmén's and Thiele's election methods". arXiv: 1611.08826 [math.HO].
5. Kilgour, D. Marc (2010). "Approval Balloting for Multi-winner Elections". In Jean-François Laslier; M. Remzi Sanver (eds.). Handbook on Approval Voting. Springer. pp. 105–124. ISBN   978-3-642-02839-7.
6. Aziz, Haris; Brill, Markus; Conitzer, Vincent; Elkind, Edith; Freeman, Rupert; Walsh, Toby (2017). "Justified representation in approval-based committee voting". Social Choice and Welfare. 48 (2): 461–485. arXiv: 1407.8269 . doi:10.1007/s00355-016-1019-3. S2CID   8564247.
7. Sánchez-Fernández, Luis; Elkind, Edith; Lackner, Martin; Fernández, Norberto; Fisteus, Jesús; Val, Pablo Basanta; Skowron, Piotr (2017-02-10). "Proportional Justified Representation". Proceedings of the AAAI Conference on Artificial Intelligence. 31 (1). doi: 10.1609/aaai.v31i1.10611 . hdl: 10016/26166 . ISSN   2374-3468. S2CID   17538641.
8. Aziz, Haris; Elkind, Edith; Huang, Shenwei; Lackner, Martin; Sánchez Fernández, Luis; Skowron, Piotr (2018). "On the Complexity of Extended and Proportional Justified Representation". Proceedings of the AAAI Conference on Artificial Intelligence. 32 (1): 902–909. doi: 10.1609/aaai.v32i1.11478 . S2CID   19124729.
9. Skowron, Piotr (2021). "Proportionality Degree of Multiwinner Rules". Proceedings of the 22nd ACM Conference on Economics and Computation. EC-21. pp. 820–840. arXiv: 1810.08799 . doi:10.1145/3465456.3467641. ISBN   9781450385541. S2CID   53046800.
10. Peters, Dominik; Skowron, Piotr (2020). "Proportionality and the Limits of Welfarism". Proceedings of the 21st ACM Conference on Economics and Computation. EC'20. pp. 793–794. arXiv: 1911.11747 . doi:10.1145/3391403.3399465. ISBN   9781450379755. S2CID   208291203.
11. Brill, Markus; Gölz, Paul; Peters, Dominik; Schmidt-Kraepelin, Ulrike; Wilker, Kai (2019). "Approval-Based Apportionment". Proceedings of the AAAI Conference on Artificial Intelligence. 34 (2): 1854–1861. arXiv: 1911.08365 . doi:10.1609/aaai.v34i02.5553. S2CID   208158445.
12. Lackner, Martin; Skowron, Piotr (2023). Multi-Winner Voting with Approval Preferences. SpringerBriefs in Intelligent Systems. arXiv: 2007.01795 . doi:10.1007/978-3-031-09016-5. ISBN   978-3-031-09015-8. S2CID   244921148.
13. Sánchez Fernández, Luis; Fisteus, Jesús (2019). "Monotonicity axioms in approval-based multi-winner voting rules" (PDF): 485–493. arXiv: 1710.04246 .{{cite journal}}: Cite journal requires |journal= (help)
14. Peters, Dominik (2018). "Single-Peakedness and Total Unimodularity: New Polynomial-Time Algorithms for Multi-Winner Elections": 1169–1176. arXiv: 1609.03537 .{{cite journal}}: Cite journal requires |journal= (help)
15. Aziz, Haris; Gaspers, Serge; Gudmundsson, Joachim; Mackenzie, Simon; Mattei, Nicholas; Walsh, Toby (2015). Computational Aspects of Multi-Winner Approval Voting. pp. 107–115. arXiv: 1407.3247 . ISBN   978-1-4503-3413-6.
16. Skowron, Piotr; Faliszewski, Piotr; Lang, Jérôme (2016). "Finding a collective set of items: From proportional multirepresentation to group recommendation". Artificial Intelligence. 241: 191–216. arXiv: 1402.3044 . doi:10.1016/j.artint.2016.09.003. S2CID   11313941.
17. Bredereck, Robert; Faliszewski, Piotr; Kaczmarczyk, Andrzej; Knop, Dusan; Niedermeier, Rolf (2020). "Parameterized Algorithms for Finding a Collective Set of Items". Proceedings of the AAAI Conference on Artificial Intelligence. 34 (2): 1838–1845. doi: 10.1609/aaai.v34i02.5551 . S2CID   213963505.
18. Godziszewski, Michal; Batko, Pawel; Skowron, Piotr; Faliszewski, Piotr (2021). "An Analysis of Approval-Based Committee Rules for 2D-Euclidean Elections". Proceedings of the AAAI Conference on Artificial Intelligence. 35 (6): 5448–5455. doi: 10.1609/aaai.v35i6.16686 . S2CID   235306592.
19. Dudycz, Szymon; Manurangsi, Pasin; Marcinkowski, Jan; Sornat, Krzysztof (2020). "Tight Approximation for Proportional Approval Voting". Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. IJCAI-20. pp. 276–282. doi: 10.24963/ijcai.2020/39 . ISBN   978-0-9992411-6-5. S2CID   220484671.
20. Byrka, Jaroslaw; Skowron, Piotr; Sornat, Krzysztof (2017). Proportional Approval Voting, Harmonic k-median, and Negative Association. Vol. 107. pp. 26:1–26:14. arXiv: 1704.02183 . doi: 10.4230/LIPIcs.ICALP.2018.26 . ISBN   9783959770767. S2CID   3839722.

External links

• Online tool for computing PAV and other approval-based multi-winner methods
• Python package abcvoting containing an implementation of PAV (pypi)