# Ebert's method

Ebert's Method is a system of proportional representation that uses approval voting as 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.^{[1]}

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.

## Definition[edit | edit source]

Let:

- V voters
- C candidates
- W winners, 0<W<C
- Each voter approves or disapproves each candidate.
- Assume each voter approves at least one candidate.

A "load distribution" is a two-dimensional array with such that:

- unless v approves c
- for each candidate c, if c is a winner, otherwise .

The winner set is the set which minimizes .

## Variants[edit | edit source]

There is a Sequential version called Sequential Ebert.

There is also a modified version by Toby Pereira called PAMSAC^{[2]}

## Further reading[edit | edit source]

Two variants of Ebert's method are discussed 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.

## References[edit | edit source]

- ↑ Ebert, Bjarke D. (2003-10-02). "Alternate view of Phragmén's method".
*Election-methods mailing list archives*. - ↑ PAMSAC