Sequential proportional approval voting: Difference between revisions

m
Fix CS1 error
(Fixed link)
m (Fix CS1 error)
Line 9:
The system disadvantages minority groups who share some preferences with the majority. In terms of [[tactical voting]], it is therefore desirable to [[ Free riding | free ride ]] by withholding approval from candidates who are likely to be elected in any case. With the standard [[Jefferson method]] based reweighing it favours large factions in an attempt to mitigate [[Free_riding#Vote_Management | vote management]]. On the other hand [[D'Hondt method]] based reweighting is more fair to smaller factions.
 
It is however a much computationally simpler algorithm than (and can be considered a sequential form of) [[proportional approval voting]], permitting votes to be counted either by hand or by computer, rather than requiring a computer to determine the outcome of all but the simplest elections.<ref name="AzizGaspers2014">{{citeCite book |last1title=AzizProceedings |first1=Harisof |author2=Sergethe Gaspers,2015 JoachimInternational Gudmundsson,Conference Simonon Mackenzie,Autonomous NicholasAgents Mattei,& TobyMultiagent WalshSystems: |title=ProceedingsMay, of4 the- 8, 2015, Istanbul, Turkey|date=2015|publisher=ACM|editor-last=International ConferenceFoundation onfor Autonomous Agents and Multiagent Systems|location=New York, NY|chapter=Computational Aspects of Multi-Winner Approval Voting |chapterurl=https://arxiv.org/pdf/1407.3247v1.pdf |pages=107–115 |isbn=978-1-4503-3413-6}}</ref>
 
== Notes ==
1,204

edits