View source for Method of equal shares

{{Short description|Method of counting ballots following elections}}
{{Electoral systems}}

The '''method of equal shares'''<ref name=":3">{{cite book|last1= Lackner |first1= Martin |last2=Skowron|first2=Piotr|title= Multi-Winner Voting with Approval Preferences |chapter=|series= SpringerBriefs in Intelligent Systems |year=2023|doi= 10.1007/978-3-031-09016-5 |arxiv=2007.01795|isbn= 978-3-031-09015-8 |s2cid= 244921148 }}</ref><ref name=":0">{{Cite journal|last1=Peters|first1=Dominik|last2=Pierczyński|first2=Grzegorz|last3=Skowron|first3=Piotr|title=Proportional Participatory Budgeting with Additive Utilities.|journal=Proceedings of the 2021 Conference on Neural Information Processing Systems|series=NeurIPS'21|year=2021|arxiv=2008.13276 |url=https://openreview.net/pdf?id=5rm0b_fsNZ}}</ref><ref name=":1">{{Cite book|last1=Peters|first1=Dominik|last2=Skowron|first2=Piotr|title=Proceedings of the 21st ACM Conference on Economics and Computation |chapter=Proportionality and the Limits of Welfarism |series=EC'20|year=2020|pages=793–794|doi=10.1145/3391403.3399465|isbn=9781450379755|s2cid=208291203|arxiv=1911.11747}}</ref><ref name=":2">{{Cite book|last1= Freeman |first1= Rupert |last2=Kahng|first2=Anson|last3=Pennock|first3=David|title= Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence |chapter= Proportionality in Approval-Based Elections with a Variable Number of Winners |series=IJCAI'20|year=2020|volume= 1 |pages=132–138|doi=10.24963/ijcai.2020/19|isbn= 978-0-9992411-6-5 |s2cid= 211052991 |chapter-url=https://www.ijcai.org/proceedings/2020/19|doi-access=free}}</ref> is a proportional method of counting ballots that applies to [[participatory budgeting]],<ref name=":0" /> to [[multiwinner voting|committee elections]],<ref name=":1" /> and to simultaneous public decisions.<ref name=":2" /><ref>{{Cite book|last1=Conitzer|first1=Vincent|last2=Freeman|first2=Rupert|last3=Shah|first3=Nisarg|title=Proceedings of the 2017 ACM Conference on Economics and Computation |chapter=Fair Public Decision Making |series=EC'17|year=2017|pages=629–646|doi=10.1145/3033274.3085125|arxiv=1611.04034|isbn=9781450345279 |s2cid=30188911 }}</ref> It can be used when the voters vote via [[approval ballot]]s, [[ranked ballots]] or [[cardinal voting|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".<ref name=":3" />

In 2023, the method of equal shares was being used in a participatory budgeting program in the Polish city of [[Wieliczka]].<ref>{{Cite web |date=2023-03-09 |title=Zielony Milion - rusza nowatorski projekt BO w Wieliczce [WIDEO] |url=https://glos24.pl/zielony-milion-rusza-nowatorski-projekt-bo-w-wieliczce-wideo |access-date=2023-03-11 |website=Głos24 |language=pl}}</ref> The program, known as Green Million (''Zielony Milion''), was set to distribute 1 million [[Polish złoty|złoty]] to ecological projects proposed by residents of the city. It was also used in a participatory budgeting program in the Swiss city of [[Aarau]] in 2023 (''Stadtidee'').<ref>{{Cite web |last=Stadt Aarau |title=Abstimmungsphase - Stadtidee Aarau |url=https://www.stadtidee.aarau.ch/abstimmungsphase.html/1937 |access-date=2023-03-11 |website=stadtidee.aarau.ch}}</ref>

== Use in academic literature ==
The method of equal shares was first discussed in the context of committee elections in 2019, initially under the name "Rule X".<ref name=":3" /><ref name=":1" /><ref name=":2" /> From 2022, the literature has referred to the rule as the ''method of equal shares'', particularly when referring to it in the context of [[participatory budgeting algorithm]]s.<ref name=":0" /><ref>{{Cite arXiv |last1=Rey |first1=Simon |last2=Maly |first2=Jan |date=2023-03-08 |title=The (Computational) Social Choice Take on Indivisible Participatory Budgeting |class=cs.GT |eprint=2303.00621 }}</ref> The method can be described as a member of a class of voting methods called [[Expanding Approvals Rule|expanding approvals rules]] introduced earlier in 2019 by Aziz and Lee for ordinal preferences (that include approval ballots).<ref name=":20">{{Cite arXiv |eprint=1911.00864 |class=cs.GT |first1=Haris |last1=Aziz |first2=Barton E. |last2=Lee |title=Proportionally Representative Participatory Budgeting with Ordinal Preferences |year=2019}}</ref>

== Motivation ==
The method is an alternative to the [[Participatory budgeting algorithm#Knapsack budgeting|knapsack algorithm]] which is used by most cities even though it is a disproportional method. For example, if 51 percent of the population support 10 red projects and 49 percent support 10 blue projects, and the money suffices only for 10 projects, the knapsack budgeting will choose the 10 red supported by the 51 percent, and ignore the 49 percent altogether.<ref name=":6">{{Cite journal|last1=Fluschnik|first1=Till|last2=Skowron|first2=Piotr|last3=Triphaus|first3=Mervin|last4=Wilker|first4=Kai|date=2019-07-17|title=Fair Knapsack|journal=Proceedings of the AAAI Conference on Artificial Intelligence|language=en|volume=33|pages=1941–1948|doi=10.1609/aaai.v33i01.33011941|issn=2374-3468|doi-access=free}}</ref> In contrast, the method of equal shares would pick 5 blue and 5 red projects.

The method guarantees [[proportional representation]]: it satisfies a strong variant of the [[justified representation]] axiom adapted to participatory budgeting.<ref name=":0" /> This says that a group of X percent of the population will have X percent of the budget spent on projects supported by the group (assuming that all members of the group have voted the same or at least similarly).

== Intuitive explanation ==

In the context of participatory budgeting the method assumes that the municipal budget is initially evenly distributed among the voters. Each time a project is selected its cost is divided among those voters who supported the project and who still have money. The savings of these voters are decreased accordingly. If the voters vote via [[approval ballot]]s, then the cost of a selected project is distributed equally among the voters; if they vote via [[cardinal voting|cardinal ballots]], then the cost is distributed proportionally to the utilities the voters enjoy from the project. The rule selects the projects which can be paid this way, starting with those that minimise the voters' marginal costs per utility.

=== Example 1 ===
The following example with 100 voters and 9 projects illustrates how the rule works. In this example the total budget equals $1000, that is it allows to select five from the nine available projects. See the animated diagram below, which illustrates the behaviour of the rule.

<div style="margin-top:-54px;"></div>
<gallery mode="slideshow" style="width:550px !important;" position="top">
File:MethodOfEqualShares-Example1.png|none| <div style="min-height: 65px; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> There are 9 projects. For example, the third group of 11 voters voted for D and G. The total budget of $1000 is divided equally among 100 voters. Each voter is given 10. Click on the arrow above the image in order to see the next steps of the method. </div>
File:MethodOfEqualShares-Example1a.png| <div style="min-height: 65px; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> Project D obtained most votes. If we divided the cost of D equally among its supporters, each voter would pay $3.03. D is the project that minimises the maximal voter payment and so it is selected. </div>
File:MethodOfEqualShares-Example1b.png|none| <div style="min-height: 65px; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> Project A obtained 60 votes. Analogously to the previous step: if we divided the cost of A equally among its supporters, each voter would pay at most $3.33. Project A minimises the maximal voter payment and so is selected. </div>
File:MethodOfEqualShares-Example1c.png|none| <div style="min-height: 65px; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> Project C obtained 56 votes and is selected in the third round. Each supporter of C needs to pay $3.64, and this is the minimal possible payment. At this point the first 46 voters run out of their money. </div>
File:MethodOfEqualShares-Example1d.png|none| <div style="min-height: 65px; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> In the fourth step project G is selected. Some voters do not have enough money to participate equally in the purchase, so they pay all money left. The maximal payment for this candidate equals $6.97. </div>
File:MethodOfEqualShares-Example1e.png|none| <div style="min-height: 65px; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> In the last step, project H is selected. Now, only the fourth group of voters has money. They have enough money to afford the project they voted for. The maximal payment for the selected project is now $10. </div>
</gallery>
<div style="margin-top:-54px;"></div>

The budget is first divided equally among the voters, thus each voters gets $10. 
Project <math>\mathrm{D}</math> received most votes, and it is selected in the first round. If we divided the cost of <math>\mathrm{D}</math> equally among the voters, who supported <math>\mathrm{D}</math>, each of them would pay <math>\$200/66 \approx \$3.03</math>. In contrast, if we selected, e.g., <math>\mathrm{E}</math>, then the cost per voter would be <math>\$200/46 \approx \$4.34</math>. The method selects first the project that minimises the price per voter.

Note that in the last step project <math>\mathrm{H}</math> was selected even though there were projects which were supported by more voters, say <math>\mathrm{E}</math>. This is because, the money that the supporters of <math>\mathrm{E}</math> had the right to control, was used previously to justify the selection of <math>\mathrm{D}</math>, <math>\mathrm{A}</math>, and <math>\mathrm{C}</math>. On the other hand, the voters who voted for <math>\mathrm{H}</math> form 20 percent of the population, and so shall have right to decide about 20 percent of the budget. Those voters supported only <math>\mathrm{H}</math>, and this is why this project was selected.

For a more detailed example including [[cardinal voting|cardinal ballots]] see [[#Example 2|Example 2]].

== Definition ==
This section presents the definition of the rule for [[cardinal voting|cardinal ballots]]. See [[#Discussion|discussion]] for a discussion on how to apply this definition to [[approval ballot]]s and [[ranked ballots]].

We have a set of projects <math>P = \{p_1, p_2, \ldots, p_m\}</math>, and a set of voters <math>N = \{1, 2, \ldots, n\}</math>. For each project <math>p \in P</math> let <math>\mathrm{cost}(p)</math> denote its cost, and let <math>b</math> denote the size of the available municipal budget. For each voter <math>i \in N</math> and each project <math>p \in P</math> let <math>u_i(p) </math> denote the <math>i</math>'s cardinal ballot on <math>c</math>, that is the number that quantifies the level of appreciation of voter <math>i</math> towards project <math>p</math>.

The method of equal shares works in rounds. At the beginning it puts an equal part of the budget, in each voter's virtual bank account, <math>b_i = b/n</math>. In each round the method selects one project according to the following procedure.
{{Ordered list|list-style-type=numeric
| For each not-yet-selected project <math> p \in P</math> the method tries to spread the cost of the project proportionally to the cardinal ballots submitted by the voters, taking into account the fact that some voters might have already run out of money. Formally, for <math>\rho \ge 0</math>, we say that a not-yet-selected project <math>p</math> is <math>\rho</math>-affordable if

{{center|<math>\begin{align}
		\sum_{i \in N} \min\left( b_i, u_i(p) \cdot \rho \right) = \mathrm{cost}(p) \text{.}
\end{align}</math>}}

Intuitively, if a project <math>p</math> is <math>\rho</math>-affordable then, the cost of the project can be spread among the voters in a way that each voter pays the price-per-utility of at most <math>\rho</math>.

| If there are no <math>\rho</math>-affordable projects then the method of equal shares finishes. This happens when for each not-yet selected project <math>p</math> the remaining amount of money in the private accounts of those voters who submitted a positive ballot on <math>p</math> is lower than the cost of <math>p</math>: 
<math>
\textstyle\sum_{i \in N\colon  u_i(p) > 0} b_i < \mathrm{cost}(p) \text{.}
</math>

It might happen that when the method finishes, there is still some money left that would allow to fund a few more projects. This money can be spent using the simple greedy procedure that select the remaining projects <math>p</math> starting from those with the lowest ratio <math>\mathrm{cost}(p)/\textstyle\sum_{i \in N}u_i(p) </math>, until the budget is exhausted. Yet, the method of equal shares keeps most of its properties independently of how the remaining budget is spent.

| If there is at least one not-yet-selected <math>\rho</math>-affordable project, the method selects the project <math>p</math> that is <math>\rho</math>-affordable for the lowest value of <math>\rho</math> (the project that minimises the price-per-utility that the voters need to pay). The voters' budgets are updated accordingly: for each <math>i \in N</math> the method sets <math>b_i := \max(0, b_i - u_i(p) \cdot \rho)</math>.
}}

=== Example 2 ===

The following diagram illustrates the behaviour of the method.

<div style="margin-top:-54px;"></div>
<gallery mode="slideshow" style="width:550px !important;" position="top">

File:MethodOfEqualShares-Example2.png|none|<div style="min-height: 110px; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> There are 8 available projects and 250 voters. For example, the first 65 voters assign value 30 to project B and value 10 to projects E and G. The total budget of $2500 is divided equally among 250 voters. Each voter is given $10. Click on the arrow above the image in order to see the next steps of the method. </div>

File:MethodOfEqualShares-Example2a.png|none|<div style="min-height: 110px !important; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> Project B is selected first, and its cost is divided proportionally to the values that the voters assigned to the project. In this case, this means it is divided equally among the voters from the first and the second group. Each such voter pays $2, and for those $2 they get the utility of 30. Thus the maximal payment-per-utility equals <math>2/30 \approx 0.066 </math>. If a different project was selected, the maximal payment-per-utility would be higher. </div>

File:MethodOfEqualShares-Example2b.png|none|<div style="min-height: 110px !important; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> Consider project G and the payments presented in the picture. The payments are not equal, but they are still proportional to the values that the voters' assigned to G. The maximal voter's payment-per-utility for project G equals <math>1/10 = 4/40 = 10/100 = 0.1</math> and this value is minimal across all projects. Consequently, G is selected. After this round the voters from the fourth group have run out of money. </div>

File:MethodOfEqualShares-Example2c.png|none| <div style="min-height: 110px !important; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> In the third round project F is selected. Every supporter of F pays an equal part of the price - except for voters from the fourth group, who have no money. If they had any, they would also need to participate. Nevertheless, the maximal payment-per-utility for project F is minimal (it equals 0.2), hence F is elected. </div>

File:MethodOfEqualShares-Example2d.png|none|<div style="min-height: 110px !important; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> In the fourth round, project E is elected. Consider the payments presented in the picture, and note that the voters from the third group have too little money to participate in paying proportionally to their utilities, yet they all still have $4 left. In such case, they pay all money they still have. The maximal payment-per-utility (paid by the voters from the first group) is minimal, and equals circa 0.54. </div>

File:MethodOfEqualShares-Example2e.png|none|<div style="min-height: 110px !important; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> In the last step, project C is elected. The voters from the second and the sixth group have too little money to participate in paying proportionally to their utilities, hence they pay as much as possible. The maximal payment-per-utility is paid for the fifth group of voters and equals 0.7.</div>

File:MethodOfEqualShares-Example2e.png|none|<div style="min-height: 110px !important; background:#f8f9fa; border: 1px solid; border-color: #eaecf0;"> The rule spent $2380 out of $2500 in the budget. While the voters from the first and the fifth group have positive savings, no project can be afforded by their supporters. Hence the algorithm stops. The outcome can be further completed. According to the utilitarian strategy project H would be selected as its cost per utility equals <math>110 / (2\cdot 50 + 1\cdot 10 + 1 \cdot 55) </math> and is maximal across the projects that would fit within the budget constraint. </div>
</gallery>
<div style="margin-top:-54px;"></div>

== Discussion ==

This section provides a discussion on other variants of the method of equal shares.

=== Other types of ballots ===

The method of equal shares can be used with other types of voters ballots.

==== Approval ballots ====

The method can be applied in two ways to the setting where the voters vote by marking the projects they like (see [[#Example 1|Example 1]]): 
# Setting <math> u_i(p) = \mathrm{cost}(p) </math> if project <math> p </math> is approved by voter <math> i </math>, and <math> u_i(p) = 0 </math> otherwise. This assumes that the utility of a voter equals the total amount of money spent on the projects supported by the voter. This assumption is commonly used in other methods of counting approval ballots for participatory budgeting, for example in the [[Participatory budgeting algorithm#Knapsack budgeting|knapsack algorithm]], and typically results in selecting fewer more expensive projects.
# Setting <math> u_i(p) = 1 </math> if project <math> p </math> is approved by voter <math> i </math>, and <math> u_i(p) = 0 </math> otherwise. This assumes that the utility of a voter equals the number of approved selected projects. This typically results in selecting more but less expensive projects.

==== Ranked ballots ====

The method applies to the model where the voters vote by ranking the projects from the most to the least preferred one. Assuming [[lexicographic preferences]], one can use the convention that <math> u_i(p) </math> depends on the position of project <math> p </math> in the voter's <math> i </math> ranking, and that <math>u_i(p)/u_i(p') \to \infty </math>, whenever <math> i </math> ranks <math> p </math> as more preferred than <math> p' </math>.

Formally, the method is defined as follows.

For each voter <math>i \in N</math> let <math>\succ_i </math> denote the ranking of voter <math>i</math> over the projects. For example, <math>Y \succ_i X  \succ_i Z</math> means that <math>Y</math> is the most preferred project from the perspective of voter <math>i</math>, <math>X</math> is the voter's second most preferred project and <math>Z</math> is the least preferred project. In this example we say that project <math>Y</math> is ranked in the first position and write <math>\mathrm{pos}_i(Y) = 1</math>, project <math>X</math> is ranked in the second position (<math>\mathrm{pos}_i(X) = 2</math>), and <math>Z</math> in the third position (<math>\mathrm{pos}_i(Z) = 3</math>).

Each voter is initially assigned an equal part of the budget <math>b_i = b/n</math>. The rule proceeds in rounds, in each round:
{{Ordered list|list-style-type=numeric
| For each not-yet-selected project <math> p \in P</math> we say that <math>p</math> is <math>\delta</math>-affordable if the remaining budget of the voters who rank <math> p </math> at position <math>\delta</math> or better is greater than or equal to <math> \mathrm{cost}(p)</math>:

{{center|<math>\begin{align}
		\sum_{i \in N \colon \mathrm{pos}_i(p) \leq \delta} b_i \geq \mathrm{cost}(p) \text{.}
\end{align}</math>}}

| If no project is affordable the rule stops. This happens when the total remaining budget of the voters <math>\textstyle\sum_{i \in N}b_i</math> is lower than the cost of each not-yet-selected project.

| If there are affordable projects, then the rule picks the not-yet-selected project <math>p</math> that is <math>\delta</math>-affordable for the lowest value of <math>\delta</math>. The budgets of the voters are updated accordingly. First, the cost is equally spread among the voters who rank <math>p</math> at the first position. If the budgets of these voters are insufficient to cover the cost of the project, the remaining part of the cost is further spread equally among the voters who rank <math>p</math> at the second position, etc. Formally we start with <math>\delta := 1</math> and <math>\mathrm{cost} := \mathrm{cost}(p)</math>, and proceed in the loop:

{{Ordered list|list-style-type=alpha
| If <math>\textstyle \sum_{i \in N \colon \mathrm{pos}_i(p) =\delta} b_i \geq \mathrm{cost}</math> then we find <math>\rho</math> such that <math>\textstyle \sum_{i \in N \colon \mathrm{pos}_i(p) =\delta} \min(\rho, b_i) =\mathrm{cost}</math> and for each voter <math>i \in N</math> with <math>\mathrm{pos}_i(p) =\delta</math> we set <math> b_i := \max(0, b_i - \rho)</math>.

| Otherwise, we update the cost: <math>\mathrm{cost} := \mathrm{cost} - \textstyle \sum_{i \in N \colon \mathrm{pos}_i(p) =\delta} b_i </math>. We charge the voters:
for each voter <math>i \in N</math> with <math>\mathrm{pos}_i(p) =\delta</math> we set <math> b_i := 0</math>, and move to the next position <math> \delta := \delta + 1</math>.
}}
}}

=== Committee elections ===

In the context of [[multiwinner voting|committee elections]] the projects are typically called candidates. It is assumed that cost of each candidate equals one; then, the budget <math>b</math> can be interpreted as the number of candidates in the committee that should be selected.

=== Unspent budget ===

The method of equal shares can return a set of projects that does not exhaust the whole budget. There are multiple ways to use the unspent budget:

{{Ordered list|list-style-type=numeric
| The utilitarian method: the projects <math>p</math> are selected in the order of <math> \frac{\sum_{i \in N}u_i(p)}{\mathrm{cost}(p)} </math> until no further project can be selected within the budget limit.

| Adjusting initial budget: the initial budget can be adjusted to the highest possible value which makes the method select projects, whose total cost does not exceed the unadjusted budget.
}}

== Comparison to other voting methods ==

In the context of [[multiwinner voting|committee elections]] the method is often compared to [[Proportional approval voting|Proportional Approval Voting (PAV)]], since both methods are proportional (they satisfy the axiom of [[Justified representation|Extended Justified Representation (EJR)]]).<ref name=":4">{{Cite journal|last1=Aziz|first1=Haris|last2=Brill|first2=Markus|last3=Conitzer|first3=Vincent|last4=Elkind|first4=Edith|last5=Freeman|first5=Rupert|last6=Walsh|first6=Toby|date=2017|title=Justified representation in approval-based committee voting|url=https://ideas.repec.org/a/spr/sochwe/v48y2017i2d10.1007_s00355-016-1019-3.html|journal=Social Choice and Welfare|language=en|volume=48|issue=2|pages=461–485|doi=10.1007/s00355-016-1019-3|s2cid=8564247|arxiv=1407.8269}}</ref><ref name=":1" /> The difference between the two methods can be described as follow.
{{Ordered list
| list-style-type = numeric|The method of equal shares (MES) is computable in polynomial-time, and PAV is NP-hard to compute. The [[Sequential proportional approval voting|sequential variant of PAV]] is computable in polynomial-time, but does not satisfy [[Justified representation|Justified Representation]].|PAV is [[Pareto efficiency|Pareto-optimal]], but MES is not.|MES is ''priceable''. This means that<ref name=":1" /> it is possible to assign a fixed budget to each voter, and split each voter's budget among candidates he approves, such that each elected candidate is 'bought' by the candidates who approve him, and no unelected candidate can be bought by the remaining money of the voters who approve him. MES can be viewed as an implementation of [[Lindahl equilibrium]] in the discrete model, with the assumption that the customers sharing an item must pay the same price for the item.<ref>{{Cite journal|last1=Peters|first1=Dominik|last2=Pierczynski|first2=Grzegorz|last3=Shah|first3=Nisarg|last4=Skowron|first4=Piotr|journal=Proceedings of the AAAI Conference on Artificial Intelligence |date=2021|title=Market-Based Explanations of Collective Decisions|url=https://ojs.aaai.org/index.php/AAAI/article/view/16710|language=en|pages=5656–5663|series=AAAI'21|volume=35 |issue=6 |doi=10.1609/aaai.v35i6.16710 |s2cid=222132258 |doi-access=free}}</ref>|MES extends to [[participatory budgeting]] and to [[cardinal voting|cardinal ballots]], whereas PAV does not satisfy [[Justified representation|Extended Justified Representation (EJR)]] when applied to either [[participatory budgeting]] or to [[cardinal voting|cardinal ballots]].<ref name=":0" />
}}

MES is similar to the [[Phragmen's voting rules|Phragmen's sequential rule]]. The difference is that in MES the voters are given their budgets upfront, while in the Phragmen's sequential rule the voters earn money continuously over time.<ref name=":5">{{cite arXiv|last=Janson|first=Svante|date=2018-10-12|title=Phragmen's and Thiele's election methods|class=math.HO|eprint=1611.08826}}</ref><ref>{{Cite journal|last1=Brill|first1=Markus|last2=Freeman|first2=Rupert|last3=Janson|first3=Svante|last4=Lackner|first4=Martin|date=2017-02-10|title=Phragmén's Voting Methods and Justified Representation|url=https://ojs.aaai.org/index.php/AAAI/article/view/10598|journal=Proceedings of the AAAI Conference on Artificial Intelligence|language=en|volume=31|issue=1|doi=10.1609/aaai.v31i1.10598 |s2cid=2290202 |issn=2374-3468|doi-access=free|arxiv=2102.12305}}</ref> The methods compare as follows:
{{Ordered list
| list-style-type = numeric|Both methods are computable in polynomial time, both are priceable,<ref name=":1" /> and both may fail [[Pareto efficiency|Pareto-optimality]].<ref name=":3" />|MES satisfies [[Justified representation|Extended Justified Representation (EJR)]], while the Phragmen's sequential rule satisfies Proportional Justified Representation, a weaker variant of the property.<ref name=":0" /><ref name=":5" />|The Phragmen's sequential rule satisfies committee monotonicity, while MES fails the property.<ref name=":3" />{{rp|Appendix A}}|MES extends to [[participatory budgeting]] with [[cardinal voting|cardinal ballots]], which is not the case for the Phragmen's sequential rule.<ref name=":0" />
}}

MES with adjusting initial budget, PAV and Phragmen's voting rules can all be viewed as extensions of the [[D'Hondt method]] to the setting where the voters can vote for individual candidates rather than for political parties.<ref>{{cite journal|first1=Markus|last1=Brill|first2=Jean-François|last2=Laslier|last3=Skowron|first3=Piotr|title=Multiwinner Approval Rules as Apportionment Methods|year=2018|doi=10.1177/0951629818775518|journal=Journal of Theoretical Politics|volume=30 |issue=3 |pages=358–382 |arxiv=1611.08691|s2cid=10535322 }}</ref><ref name=":1" /> MES further extends to [[participatory budgeting]].<ref name=":0" />

== Implementation ==
Below there is a Python implementation of the method that applies to participatory budgeting. For the model of committee elections, the rules is implemented as a part of the Python package [https://github.com/martinlackner/abcvoting ''abcvoting''].

<syntaxhighlight lang="python">
import math

def method_of_equal_shares(N, C, cost, u, b):
    """Method of Equal Shares

    Args:
      N:     a list of voters.
      C:     a list of projects (candidates).
      cost:  a dictionary that assigns each project its cost.
      b:     the total available budget.
      u:     a dictionary; u[c][i] is the value that voter i assigns to candidate c.
             an empty entry means that the corresponding value u[c][i] equals 0.
    """
    W = set()
    total_utility = {c: sum(u[c].values()) for c in C}
    supporters = {c: set([i for i in N if u[c][i] > 0]) for c in C}
    budget = {i: b / len(N) for i in N}
    while True:
        next_candidate = None
        lowest_rho = float("inf")
        for c in C.difference(W):
            if _leq(cost[c], sum([budget[i] for i in supporters[c]])):
                supporters_sorted = sorted(supporters[c], key=lambda i: budget[i] / u[c][i])
                price = cost[c]
                util = total_utility[c]
                for i in supporters_sorted:
                    if _leq(price * u[c][i], budget[i] * util):
                        break
                    price -= budget[i]
                    util -= u[c][i]
                rho = price / util \
                        if not math.isclose(util, 0) and not math.isclose(price, 0) \
                        else budget[supporters_sorted[-1]] / u[c][supporters_sorted[-1]]
                if rho < lowest_rho:
                    next_candidate = c
                    lowest_rho = rho
        if next_candidate is None:
            break
        W.add(next_candidate)
        for i in N:
            budget[i] -= min(budget[i], lowest_rho * u[next_candidate][i])
    return _complete_utilitarian(N, C, cost, u, b, W)  # one of the possible completions

def _complete_utilitarian(N, C, cost, u, b, W):
    util = {c: sum([u[c][i] for i in N]) for c in C}
    committee_cost = sum([cost[c] for c in W])
    while True:
        next_candidate = None
        highest_util = float("-inf")
        for c in C.difference(W):
            if _leq(committee_cost + cost[c], b):
                if util[c] / cost[c] > highest_util:
                    next_candidate = c
                    highest_util = util[c] / cost[c]
        if next_candidate is None:
            break
        W.add(next_candidate)
        committee_cost += cost[next_candidate]
    return W

def _leq(a, b):
    return a < b or math.isclose(a, b)
</syntaxhighlight>

== Extensions ==
Fairstein, Meir and Gal<ref>{{Cite arXiv |eprint=2106.05360 |last1=Fairstein |first1=Roy |last2=Meir |first2=Reshef |last3=Gal |first3=Kobi |title=Proportional Participatory Budgeting with Substitute Projects |date=2021 |class=cs.GT }}</ref> extend MES to a setting in which some projects may be [[substitute goods]].

== Empirical support ==
Fairstein, Benade and Gal<ref>{{Cite arXiv |eprint=2302.13316 |last1=Fairstein |first1=Roy |last2=Benadè |first2=Gerdus |last3=Gal |first3=Kobi |title=Participatory Budgeting Design for the Real World |date=2023 |class=cs.GT }}</ref> compare MES to greedy aggregation methods. They find that greedy aggregation leads to outcomes that are highly sensitive to the input format used, and the fraction of the population that participates. In contrast, MES leads to outcomes that are not sensitive to the type of voting format used. This means that MES can be used with approval ballots, ordinal ballots or cardinal ballots, without much difference in the outcome. These outcomes are stable even when only 25 to 50 percent of the population participates in the election.

Fairstein, Meir, Vilenchik and Gal<ref>{{Cite arXiv |eprint=2201.07546 |last1=Fairstein |first1=Roy |last2=Meir |first2=Reshef |last3=Vilenchik |first3=Dan |last4=Gal |first4=Kobi |title=Welfare vs. Representation in Participatory Budgeting |date=2022 |class=cs.GT }}</ref> study variants of MES both on real and synthetic datasets. They find that these variants do very well in practice, both with respect to [[social welfare]] and with respect to [[justified representation]].

== External links ==

* [https://equalshares.net/ Website] explaining and discussing the method of equal shares in several languages

== References ==
<!-- Inline citations added to your article will automatically display here. See en.wikipedia.org/wiki/WP:REFB for instructions on how to add citations. -->
{{reflist}}

{{voting systems}}

[[Category:Vote counting]]
[[Category:Multi-winner electoral systems]]
[[Category:Preferential electoral systems]]
[[Category:Proportional representation electoral systems]]
[[Category:Participatory budgeting]]
[[Category:Cardinal electoral systems]]
[[Category:Approval voting]]