Display title | Score DSV |
Default sort key | Score DSV |
Page length (in bytes) | 10,195 |
Namespace ID | 0 |
Page ID | 394 |
Page content language | en - English |
Page content model | wikitext |
Indexing by robots | Allowed |
Number of redirects to this page | 0 |
Counted as a content page | Yes |
Number of subpages of this page | 0 (0 redirects; 0 non-redirects) |
Edit | Allow all users (infinite) |
Move | Allow all users (infinite) |
Delete | Allow all users (infinite) |
Page creator | imported>Homunq |
Date of page creation | 19:52, 28 August 2009 |
Latest editor | Kristomun (talk | contribs) |
Date of latest edit | 13:47, 18 May 2024 |
Total number of edits | 39 |
Recent number of edits (within past 180 days) | 5 |
Recent number of distinct authors | 2 |
Description | Content |
Article description: (description ) This attribute controls the content of the description and og:description elements. | Score DSV (Declared Strategy Voting) is a method devised by Jameson Quinn. It is a hybrid of Condorcet and Score voting that is closely related to Smith//Score. You take score ballots, find the Smith set, then "renormalize" each ballot so the worst member of the Smith set is at 0 and the best is at 100. Say Violet the voter rated the Smith set members A, B, and C as 40, 38, and 30, and the non-smith members D and E as 100 and 0; that ballot will be counted as 100, 80, 0, 100, 0. The ballots are added, and the highest score wins.[1] |