Handling of neutral information by aggregation operators
Beliakov, Gleb, Calvo, T. and Pradera, A. 2006, Handling of neutral information by aggregation operators, in IPMU 2006 : Proceedings of the 11th International Conference on Information Processing and Management of Uncertainty in Knowledge-based Systems, Editions EDK, Paris, France, pp. 587-594.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
We generalize the notion of a neutral element of aggregation operators. Our construction involves tuples of values that are neutral with respect to the result of aggregation. Neutral tuples are useful to model situations in which information from different sources, or preferences of several decision makers, cancel each other. We examine many popular classes of aggregation operators in respect to their neutral sets, and also construct new aggregation operators with predefined neutral sets
Reproduced with the specific permission of the copyright owner.
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact email@example.com.