Abstract
Preference aggregation and in particular ranking aggregation are mainly studied by the field of social choice theory but extensively applied in a variety of contexts. Among the most prominent methods for ranking aggregation, the Kemeny method has been proved to be the only one that satisfies some desirable properties such as neutrality, consistency and the Condorcet condition at the same time. Unfortunately, the problem of finding a Kemeny ranking is NP-hard, which prevents practitioners from using it in real-life problems. The state of the art of exact algorithms for the computation of the Kemeny ranking experienced a major boost last year with the presentation of an algorithm that provides searching time guarantee up to 13 alternatives. In this work, we propose an enhanced version of this algorithm based on pruning the search space when some Condorcet properties hold. This enhanced version greatly improves the performance in terms of runtime consumption.
Funder
Ministerio de Ciencia e Innovación
Gobierno del Principado de Asturias
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference19 articles.
1. Quality of life ranking of Spanish cities: A non-compensatory approach
2. Workplace Social Environment Indicator: A Comparative Analysis of European Regions
3. A Primer in Social Choice Theory: Revised Edition;Gaertner,2009
4. Essai sur l’Application de l’Analyse à la Probabilité des Décisions Rendues à la Pluralité des Voix;Condorcet,1785
5. Mémoire sur les Élections au Scrutin;Borda,1781
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献