Phragmen's voting rules: Difference between revisions

Phragmen's voting rules (view source)

Revision as of 03:49, 28 March 2023

158 bytes added , 1 year ago

Linked to archive.org version (at https://web.archive.org/web/20210613194328/https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14757 )

VisualWikitext

RobLa

Bureaucrats, Confirmed users, Administrators

4,212

edits

Revision as of 12:26, 27 March 2023 (view source) Kristomun (talk \| contribs) m (Replace dangling link to Brill et al. paper with a new link that works.) ← Older edit		Revision as of 03:49, 28 March 2023 (view source) RobLa (talk \| contribs) (Linked to archive.org version (at https://web.archive.org/web/20210613194328/https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14757 )) Tag: Visual edit Newer edit →
Line 27: == 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://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: * '''seq-Phragmén''': Phragmén's original method, described above. It attempts to minimize the maximal load by sequentially electing candidates.