Distributed Multi-Voting: Difference between revisions

Line 1:

Distributed Multi-Voting (DMV) is a Single-Winner and Multi-Winner voting system.

Distributed Multi-Voting (DMV) is a [[Single Member system|Single-Winner]] and [[Multi-Member System|Multi-Winner]] voting system.

This voting method consists of evaluating all possible elections (subset of candidates) to find out which candidate loses the most and then eliminate him, ~~and~~ ~~repeat~~ the ~~process~~.

This voting method consists of evaluating all possible elections (subset of candidates) to find out which candidate loses the most and then eliminate him; by repeating the procedure several times, 1 or more winners (candidates left) are obtained.

==Procedure==

Line 12:

===Normalization===

Given a vote like this: A[60], B[30], C[10], D[0] to normalize it to the subset of candidates A,B,C you have to:

Given a vote like this: A[60],B[30],C[10],D[0] to normalize it to the subset of candidates A,B,C you have to:

* set the candidate (s) with the lowest score between A,B,C to 0.

* apply the following formula on the other candidates:

Line 18:

v0 = value of candidate X, before normalization

v1 = value of candidate X, after normalization.

<math>\begin{equation}

v1 = (v0/S)*100

v1=\frac{v0}{S} \cdot 100

\end{equation}</math>

In normalization for the % of victory, use the same formula without setting the candidate with the lowest score to 0.