Aggregation Rules in Committee Procedures
- 289 Downloads
Very often, decision procedures in a committee compensate potential manipulations by taking into account the ordered profile of qualifications. It is therefore rejected the standard assumption of an underlying associative binary connective allowing the evaluation of arbitrary finite sequences of items by means of a one-by-one sequential process. In this paper we develop a mathematical approach for non-associative connectives allowing a sequential definition by means of binary fuzzy connectives. It will be then stressed that a connective rule should be understood as a consistent sequence of binary connective operators. Committees should previously decide about which connective rule they will be condidering, not just about a single operator.
KeywordsFuzzy Connectives Fuzzy Sets Aggregation Operators
Unable to display preview. Download preview PDF.
- T.H. Cormen, C.E. Leiserson and R.R. Rivest Introduction to Algorithms. MIT Press, Cambridge, MA (1990).Google Scholar
- J.C. Fodor, J.L. Marichal and M. Roubens. Characterization of the ordered weighted averaging operators. Institut de Mathematique, Université de Liège, Prépublication 93.011.Google Scholar
- T.C. Koopmans. Representation of preference ordering with independent components of consumption. In: C.B. McGuire and R. Radner, Eds., Decision and Organization. North-Holland, Amsterdam (1972), 57–78 (2nd edition by the University of Minnesota Press, 1986).Google Scholar
- J. Montero, J. Tejada and V. Cutello. A general model for deriving preference structures from data. European Journal Of Operational Research, to appear.Google Scholar