Phragmen's voting rules: Difference between revisions
Content added Content deleted
(Adding anchors for #seq-Phragmén, #max-Phragmén and #var-Phragmén) |
m (Replace dangling link to Brill et al. paper with a new link that works.) |
||
| Line 27: | Line 27: | ||
== Variations and implementations {{anchor|seq-Phragmén|max-Phragmén|var-Phragmén}} == |
== Variations and implementations {{anchor|seq-Phragmén|max-Phragmén|var-Phragmén}} == |
||
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:// |
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}}</ref> 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. |
* '''seq-Phragmén''': Phragmén's original method, described above. It attempts to minimize the maximal load by sequentially electing candidates. |
||