Phragmen's voting rules: Difference between revisions
Tidying up definitions of max/var-Phragmén and Ebert's Method
(Linked to archive.org version (at https://web.archive.org/web/20210613194328/https://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14757 )) |
(Tidying up definitions of max/var-Phragmén and Ebert's Method) |
||
Line 30:
* '''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 voter, but is done so optimally to minimise the total maximum load (from all candidates) on any one voter.
* '''var-Phragmén''':
* '''[[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:
| |||