Cumulative voting: Difference between revisions
Add lp-norm generalization
No edit summary |
(Add lp-norm generalization) |
||
Line 30:
Quadratic voting has all the major flaws of cumulative voting such as vote splitting and complexity.
== Generalized cumulative voting ==
Cumulative voting can be further generalized into <math>\ell_p</math>-norm cumulative voting, where a voter submits a cardinal (Range-style) ballot and that ballot is normalized to have unit <math>p</math>-norm before it is counted.
If <math>p = 1</math>, then <math>\ell_p</math>-norm cumulative voting is standard cumulative voting. If <math>p=2</math>, then it is quadratic voting, and <math>p=\infty</math> results in Approval voting.
The optimal tactical vote depends heavily on <math>p</math>. For instance, vote-splitting is a problem in standard cumulative voting but is not in Approval voting. On the other hand, the Burr dilemma is a problem in Approval voting but not in standard cumulative voting.
== Notes ==
| |||