Multi-member system: Difference between revisions
no edit summary
(→Bloc Systems: Updated to be consistent with updates on the Cardinal Voting page.) |
Dr. Edmonds (talk | contribs) No edit summary |
||
Line 9:
*'''Bloc Score Voting''': Each voter scores all the candidates on a scale with three or more units. Starting the scale at zero is preferable. Add all the scores. Elect the candidates with the highest total score until all positions are filled.
*'''Bloc STAR Voting''': Each voter scores all the candidates on a scale from 0-5. All the scores are added and the two highest scoring candidates advance to an automatic runoff. The finalist who was preferred by (scored higher by) more voters wins the first seat. The next two highest scoring candidates then runoff, with the finalist preferred by more voters winning the next seat. This process continues until all positions are filled.
*'''[
*'''[[Single non-transferable vote]]''': Each voter can select as many candidates as there are to be winners
==Sequential [[Proportional representation|Proportional]] Methods==
Line 20 ⟶ 22:
* [[Allocated Score]]
* [[Sequentially Subtracted Score]]
* [[Single
==[https://rangevoting.org/QualityMulti.html Optimal] [[Proportional representation | Proportional]] Methods ==
Optimal Systems select all winners at once by optimizing a specific desirable metric for proportionality. First a "quality function" or desired outcome is determined, and then an algorithm is used to determine the winner set that best maximizes that outcome. In most systems this is done by permuting to all possible winner sets not a [[W: Mathematical optimization | maximization algorithm]]. This makes such systems computationally expensive. Since ranks do not allow for the arithmatic operations to do such calculations. As such there are no optimal [[Ordinal voting]] systems but only optimal [[Cardinal voting systems]]
Common examples:
Line 31 ⟶ 34:
* [[Phragmén's Method]]
* [[Monroe's Method]]
* [https://arxiv.org/abs/1602.05248 PAMSAC]
[[Category:Multi-winner voting methods]]
|