Title
Generalization of the weighted voting method using penalty functions constructed via faithful restricted dissimilarity functions.
Abstract
In this paper we present a generalization of the weighted voting method used in the exploitation phase of decision making problems represented by preference relations. For each row of the preference relation we take the aggregation function (from a given set) that provides the value which is the least dissimilar with all the elements in that row. Such a value is obtained by means of the selected penalty function. The relation between the concepts of penalty function and dissimilarity has prompted us to study a construction method for penalty functions from the well-known restricted dissimilarity functions. The development of this method has led us to consider under which conditions restricted dissimilarity functions are faithful. We present a characterization theorem of such functions using automorphisms. Finally, we also consider under which conditions we can build penalty functions from Kolmogoroff and Nagumo aggregation functions. In this setting, we propose a new generalization of the weighted voting method in terms of one single variable functions. We conclude with a real, illustrative medical case, conclusions and future research lines. (C) 2012 Elsevier B.V. All rights reserved.
Year
DOI
Venue
2013
10.1016/j.ejor.2012.10.009
European Journal of Operational Research
Keywords
Field
DocType
Restricted dissimilarity function,Penalty function,Selection process,Weighted voting method
Mathematical optimization,Preference relation,Automorphism,Weighted voting,Construction method,Mathematics,Penalty method
Journal
Volume
Issue
ISSN
225
3
0377-2217
Citations 
PageRank 
References 
24
0.91
20
Authors
5
Name
Order
Citations
PageRank
Humberto Bustince Sola197444.53
Aranzazu Jurio231121.89
Ana Pradera315916.09
Radko Mesiar43778472.41
Gleb Beliakov598978.95