Phragmen's voting rules: Difference between revisions

From electowiki
Content added Content deleted
VisualWikitext
(→‎Implimentations: Phragmen's method is a class of methods there are several implementations)
(Added approval categories)
 
(17 intermediate revisions by 5 users not shown)
Line 1: Line 1:
{{wikipedia|Phragmen's voting rules}}
'''Phragmén's Method''' is a proportional method that works without lists.
'''Phragmén's method''' is one of the [[Cardinal_PR#Philosophies|three common interpretations]] of non-partisan [[Proportional representation]]. It is named after the inventor Lars Edvard Phragmén. It was devised as a solution to a flaw he found in Thiele's method.


Phragmén describes his method on page 88 of his original work.<ref name="Phragmen1899till">{{cite journal|
In 2002 there was a thread on the EM mailing list with subject "D'Hondt without lists" mentioning the Phragmén method.
title = Till frågan om en proportionell valmetod|
last1 = Phragmén|
first1 = Edvard|
journal = Statsvetenskaplig Tidskrift|
volume = 2|
number = 2|
pages = 297–305|
year = 1899|
url = https://www.rangevoting.org/PhragmenVoting1899.pdf
}}</ref> A translated and revised into modern terminology definition is as follows


# The ballots are [[Approval voting]] i.e. each ballot lists the set of candidates that voter "approves."
Sketch of method:
# Later on, we shall associate a "cost" with each ballot. (Phragmén used the Swedish word "belastning." Other people often prefer to translate this into the English word "load" rather than "cost.") All ballots initially have cost=0.
# Seats are elected sequentially. Perform steps 4-5 until all seats are filled:
# As soon as any candidate is elected, the N ballots share the cost of 1 from that candidate in such a way that their ballots each have equal total costs. This is to keep the maximum cost on any one voter at a minimum. (Note: at any moment, the sum of all the ballot costs is equal to the number of seats filled so far. This fact can help with checking one's calculations.)
# The candidate who wins the next seat is the one whose N supporters' ballots will each have the lowest total cost. (So, for example, the first winner is simply the most-approved candidate, because if he is approved by N voters the cost per approving-ballot is 1/N, which is minimal because N is maximal.)
# Once a candidate has been elected and the cost distributed among the voters, this cost is fixed and cannot be redistributed once later candidates are elected. If this redistribution were allowed, then the result would be further optimized and closer to the non-sequential max-Phragmén method.


In the case of a single candidate to be elected, Phragmén's method reduces to [[Approval voting]], because the candidate resulting in the minimal load on each voter is the one with most voters to share the load. When all votes are in party list order, it reduces to the [[D'Hondt method]].<ref name="Janson 2016">{{cite arXiv | last=Janson | first=Svante | title=Phragmén's and Thiele's election methods | date=2016-11-27 | eprint=1611.08826|class=math.HO}}</ref>
* Voters vote for multiple candidates. The ballot is unordered
* Each elected candidate has a load of 1 which is distributed among his voters.
* The load of a candidate is not distributed evenly among its N voters, but rather such that each of the candidate's voters end up with the same cumulated load.
* The candidates are elected iteratively - in each step electing the one that results in the most even distribution of load (i.e. minimal load on the voter with the highest load - minmax)


== Variations and implementations {{anchor|seq-Phragmén|max-Phragmén|var-Phragmén}} ==
In the case of 1 candidate to be elected, Phragméns method degenerates to [[Approval voting]] (because the candidate resulting in the minimal load on each voter is the one with most voters to share the load).


As described above, Phragmén's is a method that attempts to ensure that the winners' support are as widely distributed as possible. This can be done in different ways, and thus there exist different methods that follow the same broad principle. Brill et al.<ref name="Association for the Advancement of Artificial Intelligence">{{cite web | title=Phragmén’s Voting Methods and Justified Representation | website=Association for the Advancement of Artificial Intelligence | url=https://link.springer.com/article/10.1007/s10107-023-01926-8 | first=Markus |last=Brill |first2=Rupert |last2=Freeman |first3=Svante |last3=Janson |first4=Martin |last4=Lackner | access-date=2020-02-04|archive-url=https://web.archive.org/web/20210613194328/https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14757|archive-date=June 13, 2021|url-status=live}}</ref> identify the following variants:
==Implimentations==


* '''seq-Phragmén''': Phragmén's original method, described above. It attempts to minimize the maximal load by sequentially electing candidates.
* [[Ebert's Method]]
* '''max-Phragmén''': The non-sequential variant of seq-Phragmen: the objective is the same (minimize the maximal load), but it's treated as a global optimization problem. The load from each candidate does not have to be evenly spead across their voters, but is done so optimally to minimise the total maximum load (from all candidates) on any one voter.
* [[Max Phragmen]]
* '''var-Phragmén''': This variant minimizes the variance of the load distribution. As with max-Phragmén, the load from each candidate can be spread unevenly across their voters.
* [[Sequential Phragmen]]
* '''[[Ebert's method]]''': As var-Phragmén but where a candidate's load is evenly spread across their voters.


In addition, these variants are also described on Electowiki:
* [[Sequential Ebert]]: The sequential variant of Ebert's method.
* [[PAMSAC]]: An Ebert variant, developed by [[Toby Pereira]], that restores [[monotonicity]].

==Further reading==

* https://www.rangevoting.org/Phragmen.html

==References==

[[Category:Approval PR methods]]
[[Category:Approval voting]]
[[Category:Cardinal voting methods]]
[[Category:Proportional voting methods]]
[[Category:Multi-winner voting methods]]
[[Category:Multi-winner voting methods]]
[[Category:Cardinal PR methods]]

Latest revision as of 18:51, 10 November 2023

Wikipedia has an article on:

Phragmén's method is one of the three common interpretations of non-partisan Proportional representation. It is named after the inventor Lars Edvard Phragmén. It was devised as a solution to a flaw he found in Thiele's method.

Phragmén describes his method on page 88 of his original work.[1] A translated and revised into modern terminology definition is as follows

  1. The ballots are Approval voting i.e. each ballot lists the set of candidates that voter "approves."
  2. Later on, we shall associate a "cost" with each ballot. (Phragmén used the Swedish word "belastning." Other people often prefer to translate this into the English word "load" rather than "cost.") All ballots initially have cost=0.
  3. Seats are elected sequentially. Perform steps 4-5 until all seats are filled:
  4. As soon as any candidate is elected, the N ballots share the cost of 1 from that candidate in such a way that their ballots each have equal total costs. This is to keep the maximum cost on any one voter at a minimum. (Note: at any moment, the sum of all the ballot costs is equal to the number of seats filled so far. This fact can help with checking one's calculations.)
  5. The candidate who wins the next seat is the one whose N supporters' ballots will each have the lowest total cost. (So, for example, the first winner is simply the most-approved candidate, because if he is approved by N voters the cost per approving-ballot is 1/N, which is minimal because N is maximal.)
  6. Once a candidate has been elected and the cost distributed among the voters, this cost is fixed and cannot be redistributed once later candidates are elected. If this redistribution were allowed, then the result would be further optimized and closer to the non-sequential max-Phragmén method.

In the case of a single candidate to be elected, Phragmén's method reduces to Approval voting, because the candidate resulting in the minimal load on each voter is the one with most voters to share the load. When all votes are in party list order, it reduces to the D'Hondt method.[2]

Variations and implementations

As described above, Phragmén's is a method that attempts to ensure that the winners' support are as widely distributed as possible. This can be done in different ways, and thus there exist different methods that follow the same broad principle. Brill et al.[3] identify the following variants:

  • seq-Phragmén: Phragmén's original method, described above. It attempts to minimize the maximal load by sequentially electing candidates.
  • max-Phragmén: The non-sequential variant of seq-Phragmen: the objective is the same (minimize the maximal load), but it's treated as a global optimization problem. The load from each candidate does not have to be evenly spead across their voters, but is done so optimally to minimise the total maximum load (from all candidates) on any one voter.
  • var-Phragmén: This variant minimizes the variance of the load distribution. As with max-Phragmén, the load from each candidate can be spread unevenly across their voters.
  • Ebert's method: As var-Phragmén but where a candidate's load is evenly spread across their voters.

In addition, these variants are also described on Electowiki:

Further reading

References

  1. ↑ Phragmén, Edvard (1899). "Till frågan om en proportionell valmetod" (PDF). Statsvetenskaplig Tidskrift. 2 (2): 297–305.
  2. ↑ Janson, Svante (2016-11-27). "Phragmén's and Thiele's election methods". arXiv:1611.08826 [math.HO].
  3. ↑ Brill, Markus; Freeman, Rupert; Janson, Svante; Lackner, Martin. "Phragmén's Voting Methods and Justified Representation". Association for the Advancement of Artificial Intelligence. Archived from the original on June 13, 2021. Retrieved 2020-02-04.
Retrieved from "https://electowiki.org/wiki/Phragmen%27s_voting_rules?oldid=17774"