Borda count: Difference between revisions

m
Add Kemeny approximation information
m (Add Kemeny approximation information)
Line 3:
The '''Borda count''' is a [[voting system]] used for single-winner [[election]]s [[preferential voting|in which each voter rank-orders the candidates]].
 
The Borda count was devised by [[Jean-Charles de Borda]] in June of 1770. It was first published in 1781 as ''Mémoire sur les élections au scrutin'' in the Histoire de l'Académie Royale des Sciences, Paris. This method was devised by Borda to fairly elect members to the [[French Academy of Sciences]] and was used by the Academy beginning in 1784 until quashed by [[Napoleon]] in 1800.
 
The Borda count is classified as a [[positional voting system]] because each rank on the ballot is worth a certain number of points. Other positional methods include [[first-past-the-post]] (plurality) voting, and minor methods such as "vote for any two" or "vote for any three".
Line 106:
 
The Borda count can be done in different ways depending on how points are assigned. For certain variants, it may be possible to find the Borda scores for the candidates using [[pairwise preference]]<nowiki/>s. <ref>https://rangevoting.org/Wright_Barry.pdf "We can also compute the Borda Count social preference order by summing the rows of the margin of victory matrix. To see why, consider this deconstruction of the Borda Count score. Since even a last place candidate gets 1 point, each candidate automatically gets n points, where n is the number of voters. Then for each pairwise victory, the candidate must be ranked one slot above another candidate on a particular ballot. Thus, the remaining points are exactly equal to the number of pairwise victories the candidate has. Since there is a clear bijection between the total number of pairwise victories and the sum of the entries in a candidate’s row of the margin of victory matrix, we can simply use this value"</ref><ref>https://web.stanford.edu/~jdlevin/Papers/Voting.pdf bottom of p.11-12 "Since every point a candidate receives may be considered a head-to-head vote against some other candidate, Borda scores are equal to the total number of head-to-head votes a candidate receives. This means we can count Borda scores by writing a paired-comparisons matrix and summing the rows to generate the candidates' scores."</ref>
 
The Borda count returns a social order with Kemeny distance at most five times that of the [[Kemeny-Young method]].<ref>{{cite journal|
title = Ordering by weighted number of wins gives a good ranking for weighted tournaments|
last1 = Coppersmith|
first1 = Don|
last2 = Fleischer|
first2 = Lisa|
last3 = Rudra|
first3 = Atri|
journal = Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm|
pages = 776–782|
year = 2006|
url = http://www.cse.buffalo.edu/faculty/atri/papers/algos/fas-soda.pdf
}}</ref>
 
==See also==
* [[Correlated Instant Borda Runoff]]
 
==References==
<references/>
 
==Further reading==
1,196

edits