Distributed Score Voting: Difference between revisions

← Older edit

Distributed Score Voting (view source)

Revision as of 00:58, 25 February 2020

2 bytes added , 4 years ago

no edit summary

VisualWikitext

BetterVotingAdvocacy

1,895

edits

Revision as of 16:26, 9 February 2020 (view source) Aldo Tragni (talk \| contribs) mNo edit summary ← Older edit		Latest revision as of 00:58, 25 February 2020 (view source) BetterVotingAdvocacy (talk \| contribs) No edit summary
(4 intermediate revisions by 2 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, ~~this~~it's ~~voting~~similar ~~method consists of the~~to [[Smith//Score ~~voting\|Score Voting~~]] ~~in which all candidates outside the [[Smith set]] are first excluded as winners~~. 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 158: <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]]. Line 180 ⟶ 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]]