Borda count: Difference between revisions

Line 119:

year = 2006|

url = http://www.cse.buffalo.edu/faculty/atri/papers/algos/fas-soda.pdf

}}</ref> Generalizing the Borda count to incomplete rankings takes more care: some such generalizations have a constant approximation factor to [[Kemeny-Young]] while others can be arbitrarily bad.<ref name="Mathieu Mauras 2020 pp. 2810–2822">{{cite book | last=Mathieu | first=Claire | last2=Mauras | first2=Simon | journal=Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA) | title=How to aggregate Top-lists: Approximation algorithms via scores and average ranks | publisher=Society for Industrial and Applied Mathematics | publication-place=Philadelphia, PA | year=2020 | doi=10.1137/1.9781611975994.171 | pages=2810–2822|url=https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.171}}</ref>

}}</ref> Generalizing the Borda count to incomplete rankings takes more care; some such generalizations have a constant approximation factor to [[Kemeny-Young]] while others can be arbitrarily bad.<ref name="Mathieu Mauras 2020 pp. 2810–2822">{{cite book | last=Mathieu | first=Claire | last2=Mauras | first2=Simon | journal=Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA) | title=How to aggregate Top-lists: Approximation algorithms via scores and average ranks | publisher=Society for Industrial and Applied Mathematics | publication-place=Philadelphia, PA | year=2020 | doi=10.1137/1.9781611975994.171 | pages=2810–2822|url=https://epubs.siam.org/doi/pdf/10.1137/1.9781611975994.171}}</ref>

==See also==