D'Hondt method: Difference between revisions
m
Do minor cleanup, add another algorithm reference
mNo edit summary |
m (Do minor cleanup, add another algorithm reference) |
||
Line 3:
The '''d'Hondt method''' or the Jefferson method (both are equivalent, but described differently) is a highest averages method for allocating seats. This system favors large parties slightly more than the other popular [[divisor method]], [[Sainte-Laguë method|Sainte-Laguë]], does. The method described is named in the United States after Thomas Jefferson, who introduced the method for proportional allocation of seats in the United States House of Representatives in 1792, and in Europe after Belgian mathematician Victor D'Hondt, who described the methodology in 1878.
It is used in
==Allocation==
Line 123:
In some cases, a [[election threshold|threshold]] or ''barrage'' is set, and any list which does not receive that threshold will not have any seats allocated to it, even if it received enough votes to otherwise have been rewarded with a seat. Examples of countries using this threshold are Israel (1.5%) and Belgium (5%, on regional basis).
Some systems allow parties to associate their lists together into a single ''cartel'' in order to overcome the threshold, while some systems set a separate threshold for cartels. Smaller parties often form pre-election
== Jefferson's method ==
Line 285:
== Computational complexity ==
Let <math>s</math> be the number of seats and <math>r</math> be the number of parties. The standard sequential allocation procedure determines the outcome in <math>O(s \log r)</math> time.
== Extensions of theory ==
|