Nanson's method: Difference between revisions

no edit summary
(Copying a couple lines from wikipedia:Nanson's method into this article (from https://en.wikipedia.org/w/index.php?title=Nanson%27s_method&oldid=992924734 ))
No edit summary
 
Line 1:
{{wikipedia}}'''Nanson's method''' is a electoral method devised by mathematician Edward J. Nanson in 1882. In this method in every round all candidates that are on or beneath the average Borda score are eliminated each round, and the ballots are recounted as if those candidates never were on the ballot,
{{wikipedia}}
 
According to [[wikipedia:Nanson's method]]:<ref>https://en.wikipedia.org/w/index.php?title=Nanson%27s_method&oldid=992924734</ref>
<blockquote>
The [[Borda count]] [[electoral system]] can be combined with an [[Instant-runoff voting|instant-runoff]] procedure to create hybrid election methods that are called '''Nanson method''' and '''Baldwin method'''. Both methods are designed to satisfy the [[Condorcet criterion]], and allow for incomplete ballots and equal rankings.
</blockquote>
 
== Example ==
{{Tenn voting example}}This gives the following points table:
{| class="wikitable" style="border:none"
! {{diagonal split header|Candidate|Voters}}
!Memphis
!Nashville
!Knoxville
!Chattanooga
| rowspan="5" style="border: none; background: white;" |
!Score
|-
!Memphis
|42×3=126
|0
|0
|0
|126
|-
!Nashville
|42×2 = 84
|26×3 = 78
|17×1 = 17
|15×1 = 15
|194
|-
!Knoxville
|0
|26×1 = 26
|17×3 = 51
|15×2 = 30
|107
|-
!Chattanooga
|42×1 = 42
|26×2 = 52
|17×2 = 34
|15×3 = 45
|173
|}
As there were a total of 600 Borda points, and 600/4 = 150, we eliminate Memphis and Knoxville. This leaves us with Nashville and Chattanooga, which have 68 and 32 points respectively. This means Nashville wins.
[[Category:Condorcet-Borda hybrid methods]]