Search

In this paper, we consider the problem of aggregating a collection of transitive fuzzy binary relations in such a way that the aggregation process preserves transitivity. Specifically, we focus our efforts on the characterization of those functions that aggregate a collection of fuzzy binary relations which are transitive with respect to a collection of t-norms preserving the transitivity. We characterize them in terms of triangular triplets. Further, the relationship between triangular triplets, the monotonicity of the aggregation function and an appropriate dominance notion is explicitly stated. Special attention is paid to a few classes of transitive fuzzy binary relations that are relevant in the literature. Concretely, we describe, in terms of triangular triplets, those functions that aggregate a collection of fuzzy pre-orders, fuzzy partial orders, relaxed indistinguishability relations, indistinguishability relations and equalities. A surprising relationship between functions that aggregate transitive fuzzy relations into a T M -transitive fuzzy relation and those that aggregate relaxed indistinguishability relations is shown. A few consequences of the new results are also provided for those cases in which all the t-norms of the given collection are the same. Some celebrated results are retrieved as a particular case from the exposed theory.

The study of consistency in decision-making models is of great importance. Our proposal deals with a special type of extended aggregation functions to guarantee consistency that is based on T-S consistency of linearly ordered fuzzy preference relations (fuzzy ranking for preferences). Necessary conditions to ensure consistency in the aggregation process are provided. Moreover, sufficient conditions to guarantee the existence of extended aggregation functions verifying T-S consistency are presented. Some examples of functions of this type are also given. The equivalence between T-S consistency and the additive consistency for fuzzy preference relations is established.

In this contribution we address our attention on the aggregation of partial T-indistinguishability operators (relations) and partial pseudo-metrics. A characterization of those functions that allow to merge a collection of partial T–indistinguishability operators into a new one was provided by Calvo et al. in [10] by means of ( T , T M ) -tuples, but here we present another characterization in terms of ( + , max ⁡ ) -tuples. Also, we analyze the aggregation of a collection ( E i ) i = 1 n of partial T i -indistinguishability operators. Moreover, we provide that a generalized inter–exchange composition functions condition is a sufficient condition to guarantee that a function merges partial T i -indistinguishability operators into a single one. In addition, we give different expressions of those aggregation functions that are object of our study, most of them are defined by means of the additive generators of the corresponding t-norms and another particular function. We see that the functions, that merge partial S-pseudo-metrics into a new one, are related to the functions that aggregate partial pseudo-metrics. Finally, we show the relation between the functions, that merge partial T-indistinguishability operators and the functions that preserve the partial T ⁎ -pseudo-metrics in the aggregation process.