Sequential proportional approval voting: Difference between revisions
Sequential proportional approval voting (view source)
Revision as of 18:12, 12 April 2022
, 2 years agoMoved weighting formula to math markup
m (Backling to Reweighted Score Voting) |
(Moved weighting formula to math markup) |
||
Line 4:
==Description==
[[File:SPAV Flow Chart.png|thumb|Flow chart of SPAV]]
This system converts AV into a multi-round rule,<ref name="Kilgour2010">{{cite book |last=Kilgour |first=D. Marc |editor1=Jean-François Laslier |editor2=M. Remzi Sanver |title=Handbook on Approval Voting |url=https://books.google.com/books?id=mQBEAAAAQBAJ&pg=PA114 |date=2010 |publisher=Springer |isbn=978-3-642-02839-7 |pages=105–124 |chapter=Approval Balloting for Multi-winner Elections}}</ref> selecting a candidate in each round and then
At each stage, the unelected candidate with the highest approval score is elected. Then the value of each voter’s ballot is set at
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
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">{{Cite book|title=Proceedings of the 2015 International Conference on Autonomous Agents & Multiagent Systems: May, 4 - 8, 2015, Istanbul, Turkey|date=2015|publisher=ACM|editor-last=International Foundation for 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>
==
<syntaxhighlight lang="python" line="">
import pandas
Line 77:
['Blue', 'Red', 'Green', 'Yellow']
==Notes ==
SPAV's [[party list case]] is [[D'Hondt]], because its reweighting is based on D'Hondt's divisors.<ref name="Janson 2016">{{cite arXiv | last=Janson | first=Svante | title=Phragmén's and Thiele's election methods | date=2016-11-27 | eprint=1611.08826|class=math.HO}}</ref>
|