Distributed Score Voting: Difference between revisions
no edit summary
Aldo Tragni (talk | contribs) (In the procedure, candidates outside the Smith set are eliminated after the conversion of the vote (point 3).) |
No edit summary |
||
| (10 intermediate revisions by 3 users not shown) | |||
Line 1:
Distributed Score Voting (DSV) is a [[Single Member system|Single-Winner]] and [[Multi-Member System|Multi-Winner]] [[Cardinal voting systems| Cardinal voting system]].
In the [[Single Member system|Single-Winner]] part, it's similar to [[Smith//Score]]. In the [[Multi-Member System|Multi-Winner]] part, [[Distributed Multi-Voting]], the more preferred the winning candidate is in a vote, the more the weight of that vote is decreased in the choice of the next winner.
[[Category:Multi-winner voting methods]]
Line 11 ⟶ 13:
All candidates in the vote have 0 points by default.
[[File:DSV procedure
===Counting the votes===
Line 109 ⟶ 111:
The complexity in writing the vote adapts to the voter, and it’s also noted that, if 101 or 99 points are mistakenly distributed, the vote will still be valid.
==Criteria==
{| class="wikitable" style="text-align:center"
<!-- criteria headers -->
|- style="font-size:80%;"
! rowspan=1 |
! rowspan=1 style="border-left: 2px solid #a0a0a0;" | [[Majority criterion|Majority]]
! rowspan=1 | [[Majority loser criterion|Maj. loser]]
! rowspan=1 | [[Mutual majority criterion|Mutual maj.]]
! rowspan=1 | [[Condorcet criterion|Condorcet]]
! rowspan=1 | [[Condorcet loser criterion|Cond. loser]]
! rowspan=1 | [[Smith criterion|Smith]]
! rowspan=1 | [[Pareto criterion|Pareto]]
! rowspan=1 | IIA*
! rowspan=1 | [[Independence of irrelevant alternatives|IIA]]
! rowspan=1 | [[w:Independence of clones criterion|Clone proof]]
! rowspan=1 style="border-left:2px solid #a0a0a0;" | [[Monotonicity criterion|Monotone]]
! rowspan=1 | [[Consistency criterion|Consistency]]
! rowspan=1 | [[Participation criterion|Participation]]
! rowspan=1 | [[w:Reversal symmetry|Reversal<br>symmetry]]
! rowspan=1 style="border-left:2px solid #a0a0a0;" | [[Later-no-help criterion|Later-no<br>Help]]
! rowspan=1 | [[Favorite betrayal criterion|Favorite<br>betrayal]]
|- style="font-size:80%;"
<!-- Methods -->
|-
! [[Distributed_Score_Voting|DSV<br>single-winner]]
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #fd8787; font-weight: inherit;" | No
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #fd8787; font-weight: inherit;" | No
! style="background: #fd8787; font-weight: inherit;" | No
! style="background: #98ff98; font-weight: inherit;" | Yes
! style="background: #fd8787; font-weight: inherit;" | No
! style="background: #fd8787; font-weight: inherit;" | No
|}
<b>IIA*</b>: X is a set containing all the preferred candidates over B. If I add C a less appreciated candidate (in head-to-head) than the candidates in X, then all candidates in X continue to be preferred over B.
This method also passes [[ISDA]].
All the criteria not met are linked to the fact that, through tactical votes, it's possible add / remove a candidate from the [[Smith set]].
- add one more candidate into the [[Smith set]] isn't a big problem because that additional candidate must then beat all the other candidates in point 4 of the procedure (and if he manages to beat them all it makes sense that he wins).
- removing a candidate from the [[Smith set]] is only possible when that candidate lose all the head-to-head with the candidates contained in the [[Smith set]]. This actually becomes a problem only if the excluded candidate is the one who really should have won.
Below is an example in which, through tactical votes, it's possible to bring out a candidate, who should have won, from the [[Smith set]] (making him lose).
===Tactical votes===
Line 123 ⟶ 182:
* the new winner is actually a better candidate than the previous one (the new winner in the example could also be C).
* the voter has a fairly precise knowledge of the likely ballots result, without which this tactical vote would turn against him.
[[Category:Smith-efficient Condorcet methods]]
| |||