This paper focuses on the problem of combining multi-agent preference orderings of different alternatives into a single fused ordering, when the agents’ importance is expressed through a rank-ordering and not a set of weights. An enhanced version of the algorithm proposed by Yager (2001) is presented. The main advantages of the new algorithm are that: (i) it better reflects the multi-agent preference orderings and (ii) it is more versatile, since it admits preference orderings with omitted or incomparable alternatives. The description of the new algorithm is supported by a realistic example.

Fusion of multi-agent preference orderings in an ordinal semi-democratic decision-making framework / Franceschini, Fiorenzo; Maisano, DOMENICO AUGUSTO FRANCESCO; Mastrogiacomo, Luca. - In: MEASUREMENT. - ISSN 0263-2241. - STAMPA. - 91:1(2016), pp. 699-702. [10.1016/j.measurement.2016.01.034]

Fusion of multi-agent preference orderings in an ordinal semi-democratic decision-making framework

FRANCESCHINI, FIORENZO;MAISANO, DOMENICO AUGUSTO FRANCESCO;MASTROGIACOMO, LUCA
2016

Abstract

This paper focuses on the problem of combining multi-agent preference orderings of different alternatives into a single fused ordering, when the agents’ importance is expressed through a rank-ordering and not a set of weights. An enhanced version of the algorithm proposed by Yager (2001) is presented. The main advantages of the new algorithm are that: (i) it better reflects the multi-agent preference orderings and (ii) it is more versatile, since it admits preference orderings with omitted or incomparable alternatives. The description of the new algorithm is supported by a realistic example.
File in questo prodotto:
File Dimensione Formato  
MEASUREMENT Post print version.pdf

Open Access dal 29/01/2018

Descrizione: MEASUREMENT Post print version
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Creative commons
Dimensione 199.27 kB
Formato Adobe PDF
199.27 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/2644681
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo