Expanding approvals rule

Last updated

The expanding approvals rule (EAR) is a rule for multi-winner elections that guarantees a form of proportional representation called proportionality for solid coalitions. It is a generalization of the highest median rules to include multiwinner elections [1] and participatory budgeting. [2] When working with ranked ballots, it is sometimes called the Bucklin transferable vote. [3] However, the rule can be more effectively implemented using rated ballots, which are easier to use and provide additional cardinal utility information that can be used for better decision-making.

Contents

Procedure

Say there are n voters and k seats to be filled. Each voter has one vote. Groups of voters can expend their vote to elect a candidate, where the cost to elect a candidate is given by an electoral quota, most often assumed to be the Hare quota of .

EAR sets an approval threshold that advances grade by grade, starting at the highest grade and lowering the bar at each iteration. As this bar is lowered, the number of approved candidates expands. When advancing to a new rating of :

  1. EAR checks if there is a candidate who can be afforded by all voters who rate this candidate -th or better. (If there are multiple such candidates, there exist different tiebreaking rules for selecting among them; see highest median voting rules.)[ further explanation needed ]
  2. The cost of is deducted from the balance of voters who assign this a grade of or higher (there are different variants regarding how exactly the price is split among them).[ further explanation needed ]

Properties

EAR satisfies generalized proportionality for solid coalitions (GPSC): a property for ordinal weak preferences that generalizes both proportionality for solid coalitions (for strict preferences) and proportional justified representation (for dichotomous preferences). [1] Further, EAR satisfies several weak candidate monotonicity properties.[ further explanation needed ]

The method of equal shares (MES) can be seen as a special case of EAR, in which, in step 1, the elected candidate is a candidate that can be purchased in the smallest price (in general, it is the candidate supported by the largest number of voters with remaining funds), and in step 2, the price is deducted as equally as possible (those who have insufficient budget pay all their remaining budget, and the others pay equally). [4]

Single transferable vote (STV) can also be seen as a variant of EAR, in which voters always approve only their top candidate (r=1); however, if no candidate can be "purchased" by voters ranking it first, the candidate whose supporters have the fewest leftover votes is removed, bringing a new candidate to the top position of these voters. Like EAR, STV satisfies proportionality for solid coalitions. However, EAR has better candidate monotonicity properties.

Related Research Articles

Bucklin voting is a class of voting methods that can be used for single-member and multi-member districts. As in highest median rules like the majority judgment, the Bucklin winner will be one of the candidates with the highest median ranking or rating. It is named after its original promoter, the Georgist politician James W. Bucklin of Grand Junction, Colorado, and is also known as the Grand Junction system.

Later-no-harm is a property of some ranked-choice voting systems, first described by Douglas Woodall. In later-no-harm systems, increasing the rating or rank of a candidate ranked below the winner of an election cannot cause a higher-ranked candidate to lose.

In election science, a voting method satisfies the summability criterion if it is possible to tally election results locally by precinct, then calculate the results by adding up all the votes. More formally, the compilation or summation complexity of a voting system measures the difficulty of vote counting for individual precincts, and is equal to the smallest number of bits needed to summarize all the votes. A voting method is called summable if the number of bits grows as a polynomial function of the number of candidates.

Proportionality for solid coalitions (PSC) is a criterion of proportionality for ranked voting systems. It is an adaptation of the quota rule to voting systems in which there are no official party lists, and voters directly support candidates. The criterion was first proposed by the British philosopher and logician Michael Dummett.

Schulze STV is a draft single transferable vote (STV) ranked voting system designed to achieve proportional representation. It was invented by Markus Schulze, who developed the Schulze method for resolving ties using a Condorcet method. Schulze STV is similar to CPO-STV in that it compares possible winning candidate pairs and selects the Condorcet winner. It is not used in parliamentary elections.

Proportional approval voting (PAV) is a proportional electoral system for multiwinner elections. It is a multiwinner approval method that extends the highest averages method of apportionment commonly used to calculate apportionments for party-list proportional representation. 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.

<span class="mw-page-title-main">Sequential proportional approval voting</span> Multiple-winner electoral system

Sequential proportional approval voting (SPAV) or reweighted approval voting (RAV) 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. It was used in Sweden from 1909-1921, when it was replaced by a cruder "party-list" style system as it was easier to calculate, and is still used for some local elections.

Computational social choice is a field at the intersection of social choice theory, theoretical computer science, and the analysis of multi-agent systems. It consists of the analysis of problems arising from the aggregation of preferences of a group of agents from a computational perspective. In particular, computational social choice is concerned with the efficient computation of outcomes of voting rules, with the computational complexity of various forms of manipulation, and issues arising from the problem of representing and eliciting preferences in combinatorial settings.

In economics, dichotomous preferences (DP) are preference relations that divide the set of alternatives to two subsets, "Good" and "Bad".

Combinatorial participatory budgeting, also called indivisible participatory budgeting or budgeted social choice, is a problem in social choice. There are several candidate projects, each of which has a fixed costs. There is a fixed budget, that cannot cover all these projects. Each voter has different preferences regarding these projects. The goal is to find a budget-allocation - a subset of the projects, with total cost at most the budget, that will be funded. Combinatorial participatory budgeting is the most common form of participatory budgeting.

Justified representation (JR) is a criterion of fairness in multiwinner approval voting. It can be seen as an adaptation of the proportional representation criterion to approval voting.

Multiwinner approval voting, sometimes also called approval-based committee (ABC) voting, refers to a family of multi-winner electoral systems that use approval ballots. Each voter may select ("approve") any number of candidates, and multiple candidates are elected.

Multiwinner, at-large, or committeevoting refers to electoral systems that elect several candidates at once. Such methods can be used to elect parliaments or committees.

In fractional social choice, fractional approval voting refers to a class of electoral systems using approval ballots, in which the outcome is fractional: for each alternative j there is a fraction pj between 0 and 1, such that the sum of pj is 1. It can be seen as a generalization of approval voting: in the latter, one candidate wins and the other candidates lose. The fractions pj can be interpreted in various ways, depending on the setting. Examples are:

Phragmén's voting rules are rules for multiwinner voting. They allow voters to vote for individual candidates rather than parties, but still guarantee proportional representation. They were published by Lars Edvard Phragmén in French and Swedish between 1893 and 1899, and translated to English by Svante Janson in 2016.

The method of equal shares is a proportional method of counting ballots that applies to participatory budgeting, to committee elections, and to simultaneous public decisions. It can be used when the voters vote via approval ballots, ranked ballots or cardinal ballots. It works by dividing the available budget into equal parts that are assigned to each voter. The method is only allowed to use the budget share of a voter to implement projects that the voter voted for. It then repeatedly finds projects that can be afforded using the budget shares of the supporting voters. In contexts other than participatory budgeting, the method works by equally dividing an abstract budget of "voting power".

Multi-issue voting is a setting in which several issues have to be decided by voting. Multi-issue voting raises several considerations, that are not relevant in single-issue voting.

Budget-proposal aggregation (BPA) is a problem in social choice theory. A group has to decide on how to distribute its budget among several issues. Each group-member has a different idea about what the ideal budget-distribution should be. The problem is how to aggregate the different opinions into a single budget-distribution program.

Fully proportional representation(FPR) is a property of multiwinner voting systems. It extends the property of proportional representation (PR) by requiring that the representation be based on the entire preferences of the voters, rather than on their first choice. Moreover, the requirement combines PR with the requirement of accountability - each voter knows exactly which elected candidate represents him, and each candidate knows exactly which voters he represents.

Thiele's voting rules are rules for multiwinner voting. They allow voters to vote for individual candidates rather than parties, but still guarantee proportional representation. They were published by Thorvald Thiele in Danish in 1895, and translated to English by Svante Janson in 2016. They were used in Swedish parliamentary elections to distribute seats within parties, and are still used in city council elections.

References

  1. 1 2 Aziz, Haris; Lee, Barton E. (2020-01-01). "The expanding approvals rule: improving proportional representation and monotonicity". Social Choice and Welfare. 54 (1): 1–45. arXiv: 1708.07580 . doi:10.1007/s00355-019-01208-3. ISSN   1432-217X.
  2. Aziz, Haris; Lee, Barton E. (2021-05-18). "Proportionally Representative Participatory Budgeting with Ordinal Preferences". Proceedings of the AAAI Conference on Artificial Intelligence. 35 (6): 5110–5118. arXiv: 1911.00864 . doi: 10.1609/aaai.v35i6.16646 . ISSN   2374-3468.
  3. "RangeVoting.org - Bucklin Transferable Vote (BTV)". rangevoting.org. Retrieved 2024-08-14.
  4. Brill, Markus; Peters, Jannik (2023). "Robust and Verifiable Proportionality Axioms for Multiwinner Voting". arXiv: 2302.01989 [cs.GT].