The Borda Count as an Initial Threshold for Kemeny Ranking Aggregation

DOI

10.2991/asum.k.210827.074How to use a DOI?

Keywords

Ranking aggregation, Kemeny method, Borda Count, Optimization, Computational Social Choice

Abstract

The need of establishing a consensus ranking from the preferences expressed by different voters arises in several contexts. The method proposed by Kemeny to this purpose is famously known due to its numerous fulfilled properties and intuitive interpretation, as it minimizes the number of pairwise comparisons in which the consensus ranking dis-agrees with the preferences given by the voters. Nevertheless, this method has a main drawback regarding its execution time, thus preventing its use in practice. There exist some other methods, such as the Borda Count, that can be computed in polynomial time, even though they do not fulfill as many intuitive properties as the Kemeny method. Here, we propose to use the Borda Count ranking as the initial solution of a Branch- and-Bound algorithm for reducing the execution time of the Kemeny method. The presented experiments show that this approach leads to an improvement in execution time.

Copyright

© 2021, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Noelia Rico
AU  - Camino R. Vela
AU  - Raúl Pérez-Fernández
AU  - Irene Díaz
PY  - 2021
DA  - 2021/08/30
TI  - The Borda Count as an Initial Threshold for Kemeny Ranking Aggregation
BT  - Joint Proceedings of the 19th World Congress of the International Fuzzy Systems Association (IFSA), the 12th Conference of the European Society for Fuzzy Logic and Technology (EUSFLAT), and the 11th International Summer School on Aggregation Operators (AGOP)
PB  - Atlantis Press
SP  - 562
EP  - 569
SN  - 2589-6644
UR  - https://doi.org/10.2991/asum.k.210827.074
DO  - 10.2991/asum.k.210827.074
ID  - Rico2021
ER  -