Distributed Multi-Voting: Difference between revisions
Add DMV procedure (criteria are missing)
Aldo Tragni (talk | contribs) (Created page with "Distributed Multi-Voting (DMV) is a Single-Winner and Multi-Winner voting system. This voting method consists of evaluating all possible elections (subset of candidates) to f...") |
Aldo Tragni (talk | contribs) (Add DMV procedure (criteria are missing)) |
||
Line 1:
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
==Procedure==
Line 12:
===Normalization===
Given a vote like this: A[60],
* 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=\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.
| |||