Distributed 2-Voting: Difference between revisions

← Older edit

Distributed 2-Voting (view source)

Revision as of 15:22, 20 June 2022

1,321 bytes added , 1 year ago

m

Add categories, fixup capitalization

VisualWikitext

Kristomun

1,202

edits

Revision as of 12:39, 27 June 2020 (view source) Aldo Tragni (talk \| contribs) (Created page with "Distributed 2-Voting (D2V) is a Single-Winner and Multi-Winner, Cardinal voting systems. ==Procedure== Voter score candi...")		Latest revision as of 15:22, 20 June 2022 (view source) Kristomun (talk \| contribs) m (Add categories, fixup capitalization)
(3 intermediate revisions by one other user not shown)
Line 1: [[File:D2V procedure.svg\|thumb]] Distributed 2-Voting (D2V) is a [[Single Member system\|Single-Winner]] and [[Multi-Member System\|Multi-Winner]], [[Cardinal voting systems]].▼ ▲Distributed 2-Voting (D2V) is a [[Single Member system\|~~Single~~single-~~Winner~~]] and [[Multi-Member System\|~~Multi~~multi-~~Winner~~winner]], [[Cardinal voting systems\|cardinal voting method]]. ==Procedure== Voter score candidates with range [-5,+5] or [-109,+109] without the value 0. Each vote is split into two votes, which are then normalized to 100 points: * positive vote: it contains positive scores (all other scores set to 0). Line 39 ⟶ 41: Positive vote N: [0 \|0 \|0 \|0 \|0 \|7 \|13\|20\|26\|34] Negative vote N: [0 \|10\|20\|30\|40\|0 \|0 \|0 \|0 \|0 ] ===No 0 in range=== # In the range [-9,+9] the value 0 is given to a candidate considered to be best of negative candidates and worst of positive ones. To satisfy this condition, it's necessary to convert 0 to +9 in the negative vote. # The value 0 however, in the original vote, is assigned by default to the candidates who aren't evaluated (the unknown ones), and it should therefore remain 0 both in the positive and in the negative vote, because an unknown candidate must not be favored in any way. The two points indicated above are in contradiction, and this problem can be solved by forcing the voter to assign at least -1 or +1 to all candidates, even those to whom the voter would like to give 0. This is also consistent with the philosophy of the method that requires you to create 2 distinct votes, and the 0 isn't clear on which side it should stand. ==Properties== Line 44 ⟶ 53: ===Unknown candidates=== Unrated candidates (unknown ones) receive 0 points. The vote, after normalization, consists of 100 points distributed, and starting from this observation: # Inin the positive vote, it's better to favor the approved candidates, instead of using limited points on unknown candidates. # Inin the negative vote, it's better to favor the less disapproved candidate (compared to the most disapproved), instead of using limited points on unknown candidates. # ~~Rare case:~~ if there was only one disapproved candidate in the negative vote, the voter could ~~assign~~use -1the 100 negative topoints ~~all~~on unknown candidates favoring them unfairly. This case is rare because: if the candidates are few, then ~~they~~there are ~~hardly~~no unknown candidates; if there are many candidates then it's very likely that at least two differently disapproved candidates are present. Overall D2V doesn't favor unknown candidates. D2V supports that unknown candidates must not be favored in any way. ===Independence from results=== Line 125 ⟶ 134: * The positive and negative votes always have ratings >=0, in the count. The concept of "disadvantaging a candidate by favoring all others" doesn't exist in this category of methods. * if all negative votes are null at start (all values equal to 0), then the method becomes equivalent to that in which 2 votes are not used (ex. S2V without negative ratings in the original vote, is equivalent to SV). [[Category:Multi-winner voting methods]] [[Category:Cardinal voting methods]]