Aggregation and consensus for preference relations based on fuzzy partial orders
Data(s) |
23/11/2016
|
---|---|
Resumo |
We propose a framework for eliciting and aggregating pairwise preference relations based on the assumption of an underlying fuzzy partial order. We also propose some linear programming optimization methods for ensuring consistency either as part of the aggregation phase or as a pre- or post-processing task. We contend that this framework of pairwise-preference relations, based on the Kemeny distance, can be less sensitive to extreme or biased opinions and is also less complex to elicit from experts. We provide some examples and outline their relevant properties and associated concepts. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Springer |
Relação |
http://dro.deakin.edu.au/eserv/DU:30090141/beliakov-aggregation-inpress-2016.pdf http://www.dx.doi.org/10.1007/s10700-016-9258-4 |
Direitos |
2016, Springer |
Palavras-Chave | #pairwise preference relations #aggregation functions #Kemeny distance #fuzzy partial order #group decision making #linear programming |
Tipo |
Journal Article |