Consensus in multi-expert decision making problems using penalty functions defined over a Cartesian product of lattices

In this paper we introduce an algorithm to aggregate the preference relations provided by experts in multi-expert decision making problems. Instead of using a single aggregation function for the whole process, we start from a set of aggregation functions and select, by means of consensus done through penalty functions, the most suitable aggregation function in order to aggregate the individual preferences for each of the elements. An advantage of the method that we propose is that it allows us to recover the classical methods, just by using a single aggregation function. We also present a generalization of the concepts of restricted dissimilarity function and distance between sets for the case where we are working with a Cartesian product of lattices and use such concepts to build penalty functions. Finally, we propose an algorithm that allows us to choose the best combination of aggregation functions for a multi-expert decision making problem.

[1]  Francisco Herrera,et al.  Managing non-homogeneous information in group decision making , 2005, Eur. J. Oper. Res..

[2]  Weixin Xie,et al.  Some notes on similarity measure and proximity measure , 1999, Fuzzy Sets Syst..

[3]  J. Goguen L-fuzzy sets , 1967 .

[4]  Radko Mesiar,et al.  Monograph: aggregation functions , 2009 .

[5]  Humberto Bustince,et al.  Restricted equivalence functions , 2006, Fuzzy Sets Syst..

[6]  R. Mesiar,et al.  Aggregation operators: properties, classes and construction methods , 2002 .

[7]  Francisco Herrera,et al.  Integrating three representation models in fuzzy multipurpose decision making based on fuzzy preference relations , 1998, Fuzzy Sets Syst..

[8]  Humberto Bustince,et al.  Semiautoduality in a restricted family of aggregation operators , 2007, Fuzzy Sets Syst..

[9]  Marc Roubens,et al.  Some properties of choice functions based on valued binary relations , 1989 .

[10]  Eyke Hüllermeier,et al.  Learning valued preference structures for solving classification problems , 2008, Fuzzy Sets Syst..

[11]  D. Dubois,et al.  Social choice axioms for fuzzy set aggregation , 1991 .

[12]  Radko Mesiar Fuzzy set approach to the utility, preference relations, and aggregation operators , 2007, Eur. J. Oper. Res..

[13]  J. Kacprzyk Group decision making with a fuzzy linguistic majority , 1986 .

[14]  Lotfi A. Zadeh,et al.  Fuzzy Sets , 1996, Inf. Control..

[15]  E. Triesch Characterisation of Archimedian t -norms and a law of large numbers , 1993 .

[16]  Gleb Beliakov,et al.  Aggregation functions based on penalties , 2010, Fuzzy Sets Syst..

[17]  Marc Roubens,et al.  Fuzzy Preference Modelling and Multicriteria Decision Support , 1994, Theory and Decision Library.

[18]  S. Orlovsky Decision-making with a fuzzy preference relation , 1978 .

[19]  Liu Xuecheng,et al.  Entropy, distance measure and similarity measure of fuzzy sets and their relations , 1992 .

[20]  Humberto Bustince,et al.  Relationship between restricted dissimilarity functions, restricted equivalence functions and normal EN-functions: Image thresholding invariant , 2008, Pattern Recognit. Lett..

[21]  Francisco Herrera,et al.  Theory and Methodology Choice functions and mechanisms for linguistic preference relations , 2000 .

[22]  Radko Mesiar,et al.  Quantitative weights and aggregation , 2004, IEEE Transactions on Fuzzy Systems.

[23]  Eyke Hüllermeier,et al.  Combining predictions in pairwise classification: An optimal adaptive voting strategy and its relation to weighted voting , 2010, Pattern Recognit..