Number of supportable candidates in various voting methods: Difference between revisions
Number of supportable candidates in various voting methods (view source)
Revision as of 07:41, 14 May 2020
, 4 years agono edit summary
(Created page with "Voting methods can be categorized based on how many candidates they allow you to support, and to what degree. The common Choose-one FPTP voting method (and the related :...") |
No edit summary |
||
Line 5:
[[Block voting]] versions of "support-one" methods often allow "support up to the number of winners" candidates.
[[Cardinal method|Cardinal methods]] and [[Condorcet methods]] allow maximally supporting unlimited numbers of candidates. For Condorcet, this
These are also often categorized as "zero-sum" and "non-zero-sum" (or independent) voting methods, because when you have given the maximum allowed support in "limited-support" voting methods, then you are guaranteeably not giving support to any of the candidates you didn't already support. This is argued to feed polarization and lack of voter choice/power.
== Notes ==
One quirk of support-one methods is that it is generally possible to know which voters supported which candidates. For example, if candidate A has 10 votes and B 20 in FPTP, then it is known solely from this information that there were at least 30 voters in the election. That isn't the case with unlimited support systems i.e. if the candidates had [[Approval voting|approvals]] rather than votes, then there could be anywhere from 20 to 30 voters who picked one or both of them. Because of this, [[SNTV]] is [[Precinct-summable]] while [[Cardinal PR]] methods generally aren't.
[[Category:Voting theory]]
| |||