Handling neutral and absorbent information in aggregation processes

We generalize the concepts of neutral and absorbent elements of aggregation operators. We introduce two types of tuples of values: the neutral tuples and the absorbent tuples. the neutral tuples are useful in situations in which information from different sources, or preferences of several decision makers, cancel each other. Absorbent tuples are useful in situations in which certain decision makers may decide the outcome irrespective of the opinion of the others. We examine the most important classes of aggregation operators in respect to their neutral and absorbent tuples.<br /

Handling of neutral information by aggregation operators

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<br /

Handling of absorbent information by aggregation operators

We propose a generalization of the notion of the absorbent element of aggregation operators. Our construction involves tuples of values that are absorbent, that is, that decide the result of aggregation. We analyze some basic properties of this generalization and determine the absorbent tuples of some popular classes of aggregation operators.<br /

Absorbent tuples of aggregation operators

We generalize the notion of an absorbent element of aggregation operators. Our construction involves tuples of values that decide the result of aggregation. Absorbent tuples are useful to model situations in which certain decision makers may decide the outcome irrespective of the opinion of the others. We examine the most important classes of aggregation operators in respect to their absorbent tuples, and also construct new aggregation operators with predefined sets of absorbent tuples.<br /

Restricted dissimilarity functions and penalty functions

In this work we introduce the definition of restricted dissimilarity functions and we link it with some other notions, such as metrics. In particular, we also show how restricted dissimilarity functions can be used to build penalty functions