Jump to content

Ebert's method: Difference between revisions

Ebert's method (view source)

Revision as of 12:54, 5 February 2020

78 bytes added ,  4 years ago
m
Improve reference
VisualWikitext
m (Clean up math with TeX)
m (Improve reference)
Line 1:
Ebert's Method is a system of [[proportional representation]] that uses [[approval voting]] thatas a modification of [[Phragmén's Method]] and uses the same concept of loads. It was first knowingly defined by Bjarke Dahl Ebert in 2003.<ref>{{cite asweb|url=http://lists.electorama.com/pipermail/election-methods-electorama.com/2003-October/076356.html|title=Alternate a modificationview of [[Phragmén's Method]]method|website=Election-methods andmailing useslist thearchives|date=2003-10-02|last=Ebert|first=B. same concept of loadsD.}}</ref>
 
Each elected candidate has a “load” of 1 that is spread equally among their approvers (every elected candidate must be approved by at least one voter). For example, if an elected candidate is approved by 100 voters, each of these voters would have a load of 1/100 from this candidate, which would be added to their loads from the other winning candidates. The winning set of candidates is the one that minimises the sum of the squared voter loads. For example, if a voter approves two elected candidates who each had 100 approvers, this voter would have a squared load of (1/100 + 1/100)^2 = 1/2500. This would be added to the squared loads of every other voter.
Line 26:
 
== Further reading ==
An archive of Ebert's original post describing the method can be found [https://www.mail-archive.com/election-methods-electorama.com%40electorama.com/msg01084.html here].
 
Two variants of Ebert's method are discussed [https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14757 here]. One is a change to the quality function and the other is a sequential implementation. In this paper they call Ebert's method var-Phragmen.
 
Kristomun
1,229

edits

Retrieved from "https://electowiki.org/wiki/Special:MobileDiff/7285"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information