Some new results on recursive aggregation rules



Downloads per month over past year

Gómez, D. and Montero, Javier (2004) Some new results on recursive aggregation rules. In IPMU 2004 : Information Processing and Management of Uncertainty in Knowledge-based Systems : tenth International Conference.Perugia, July, 4-9, 2004: proceedings. Università degli Studi di Roma "La Sapienzia, Roma, pp. 1235-1242. ISBN 88-87242-54-2

[thumbnail of Montero198.pdf]


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.

Item Type:Book Section
Additional Information:

International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (10º,. 2004. Perugia, Italia)

Uncontrolled Keywords:Aggregation functions; Recursive rules; Fuzzy Sets.
Subjects:Sciences > Mathematics > Logic, Symbolic and mathematical
ID Code:30750
Deposited On:10 Jun 2015 10:35
Last Modified:21 Apr 2016 16:40

Origin of downloads

Repository Staff Only: item control page