Some new results on recursive aggregation rules

Abstract

As pointed by Cutello and Montero in a previous paper, consis tency of an aggregation rule based upon a sequence of binary opera tors can be justied from an operational argument, by imposing a recursive calculus. Following this recursive approach, it was later proven that under certain regularity conditions, strict increasingness leads to quasi-additive solutions. In this paper we propose an alternative and more general result, avoiding some of those regularity conditions. Moreover, we point out that in practice we should evaluate only those aggregations being allowed by the decision maker. Preference structures are considered as an illustrative example.