Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 249, Issue 1, Pages 209-223Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2015.08.022
Keywords
Preference ordering; Decision making; Aggregation; Multi-agent; Ordinal semi-democratic
Ask authors/readers for more resources
The problem of the aggregation of multi-agents preference orderings has received considerable attention in the scientific literature, because of its importance for different fields of research. Yager (2001) proposed an algorithm for addressing this problem when the agents' importance is expressed through a rank-ordering, instead of a set of weights. The algorithm by Yager is simple and automatable but is subject to some constraints, which may limit its range of application: (i) preference orderings should not include incomparable and/or omitted alternatives, and (ii) the fused ordering may sometimes not reflect the majority of the multi-agent preference orderings. The aim of this article is to present a generalized version of the algorithm by Yager, which overcomes the above limitations and, in general, is adaptable to less stringent input data. A detailed description of the new algorithm is supported by practical examples. (C) 2015 Elsevier B.V. and Association of European Operational Research Societies (EURO) within the International Federation of Operational Research Societies (IFORS). All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available