The problem of aggregating multi-agent preference orderings has received considerable attention in many fields of research, such as multi-criteria decision aiding and social choice theory; nevertheless, the case in which the agents’ importance is expressed in the form of a rank-ordering, instead of a set of weights, has not been much debated. The aim of this article is to present a novel algorithm – denominated as ‘‘Ordered Paired-Comparisons Algorithm’’ (OPCA), which addresses this decision-making problem in a relatively simple and practical way. The OPCA is organized into three main phases: (i) turning multi- agent preference orderings into sets of paired comparisons, (ii) synthesizing the paired-comparison sets, and (iii) constructing a fused (or consensus) ordering. Particularly interesting is phase two, which introduces a new aggregation process based on a priority sequence, obtained from the agents’ importance rank-ordering. A detailed description of the new algorithm is supported by practical examples.
|Titolo:||A paired-comparison approach for fusing preference orderings from rank-ordered agents|
|Data di pubblicazione:||2015|
|Digital Object Identifier (DOI):||10.1016/j.inffus.2015.01.004|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|IF Revised_INFFUS-D-14-00327R1 23-01-2015.pdf||2. Post-print||PUBBLICO - Tutti i diritti riservati||Visibile a tuttiVisualizza/Apri|
|INFORMATION FUSION v.26 n.1, 2015 pp.84-55 Paired-comparison fusing orderings FF DM LM.pdf||2. Post-print||Non Pubblico - Accesso privato/ristretto||Administrator Richiedi una copia|