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: | Noelia Rico, Camino R. Vela, Raúl Pérez-Fernández, Irene Díaz |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2021-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/9/12/1380 |
Similar Items
-
Why the Kemeny Time is Constant
Published: (2017) -
Étude algorithmique et combinatoire de la méthode de Kemeny-Young et du consensus de classements
by: Milosz, Robin
Published: (2019) -
Why the Kemeny Time is a constant
by: Gustafson Karl, et al.
Published: (2016-03-01) -
The role of Kemeny's constant in properties of Markov chains
by: Hunter, JJ
Published: (2012) -
Criteria weights balancing using Kemeny median
by: Aleksandras Krylovas, et al.
Published: (2014-12-01)