Modular relaxed indistinguishability and the aggregation problem

Abstract

[eng] The notion of indistinguishability operator plays a central role in a large number of problems that arise naturally in decision-making, artificial intelligence, and computer science. Among the different issues studied for these operators, the aggregation problem has been thoroughly explored. In some cases, the notion of indistinguishability operator can be too narrow and, for this reason, we can find two different extensions of such notion in the literature. On the one hand, modular indistinguishability operators make it possible to measure the degree of similarity or indistinguishability with respect to a parameter. On the other hand, relaxed indistinguishability operators delete the reflexivity condition of classical indistinguishability operators. In this paper, we introduced the notion of modular relaxed indistinguishability operator unifying under the same framework all previous notions. We focused our efforts on the study of the associated aggregation problem. Thus, we introduced the notion of modular relaxed indistinguishability operator aggregation function for a family of t-norms extending the counterpart formulated for classical non-modular relaxed indistinguishability operators. We provided characterizations of such functions in terms of triangle triplets with respect to a family of t-norms. Moreover, we addressed special cases where the operators fulfill a kind of monotony and a condition called small-self indistinguishability. The differences between the modular and the non-modular aggregation problem were specified and illustrated by means of suitable examples.