RT Book, Section
T1 Some new results on recursive aggregation rules
A1 Gómez González, Daniel
A1 Montero De Juan, Francisco Javier
AB 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 structuresare considered as an illustrative example.
PB Università degli Studi di Roma "La Sapienzia"
SN 88-87242-54-2
YR 2004
FD 2004
LK https://hdl.handle.net/20.500.14352/53435
UL https://hdl.handle.net/20.500.14352/53435
LA eng
NO International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (10º,. 2004. Perugia, Italia)
NO Gobierno de España
DS Docta Complutense
RD 8 abr 2025