Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties
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 de...
Main Authors: | , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/12/1380 |
id |
doaj-7b4e95f4f1384a6781ce6c893cdb97e4 |
---|---|
record_format |
Article |
spelling |
doaj-7b4e95f4f1384a6781ce6c893cdb97e42021-07-01T00:10:45ZengMDPI AGMathematics2227-73902021-06-0191380138010.3390/math9121380Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet PropertiesNoelia Rico0Camino R. Vela1Raúl Pérez-Fernández2Irene Díaz3Department of Computer Science, University of Oviedo, 33203 Gijón, SpainDepartment of Computer Science, University of Oviedo, 33203 Gijón, SpainDepartment of Statistics and O.R. and Mathematics Didactics, University of Oviedo, 33007 Oviedo, SpainDepartment of Computer Science, University of Oviedo, 33203 Gijón, SpainPreference 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.https://www.mdpi.com/2227-7390/9/12/1380ranking aggregationCondorcetKemeny methodexact algorithmrecursive method |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Noelia Rico Camino R. Vela Raúl Pérez-Fernández Irene Díaz |
spellingShingle |
Noelia Rico Camino R. Vela Raúl Pérez-Fernández Irene Díaz Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties Mathematics ranking aggregation Condorcet Kemeny method exact algorithm recursive method |
author_facet |
Noelia Rico Camino R. Vela Raúl Pérez-Fernández Irene Díaz |
author_sort |
Noelia Rico |
title |
Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties |
title_short |
Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties |
title_full |
Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties |
title_fullStr |
Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties |
title_full_unstemmed |
Reducing the Computational Time for the Kemeny Method by Exploiting Condorcet Properties |
title_sort |
reducing the computational time for the kemeny method by exploiting condorcet properties |
publisher |
MDPI AG |
series |
Mathematics |
issn |
2227-7390 |
publishDate |
2021-06-01 |
description |
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. |
topic |
ranking aggregation Condorcet Kemeny method exact algorithm recursive method |
url |
https://www.mdpi.com/2227-7390/9/12/1380 |
work_keys_str_mv |
AT noeliarico reducingthecomputationaltimeforthekemenymethodbyexploitingcondorcetproperties AT caminorvela reducingthecomputationaltimeforthekemenymethodbyexploitingcondorcetproperties AT raulperezfernandez reducingthecomputationaltimeforthekemenymethodbyexploitingcondorcetproperties AT irenediaz reducingthecomputationaltimeforthekemenymethodbyexploitingcondorcetproperties |
_version_ |
1721349343405932544 |