Aggregation Rules in Committee Procedures

Abstract

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.