A New Approach to Interval-Valued Choquet Integrals and the Problem of Ordering in Interval-Valued Fuzzy Set Applications

We consider the problem of choosing a total order between intervals in multiexpert decision making problems. To do so, we first start researching the additivity of interval-valued aggregation functions. Next, we briefly treat the problem of preserving admissible orders by linear transformations. We study the construction of interval-valued ordered weighted aggregation operators by means of admissible orders and discuss their properties. In this setting, we present the definition of an interval-valued Choquet integral with respect to an admissible order based on an admissible pair of aggregation functions. The importance of the definition of the Choquet integral, which is introduced by us here, lies in the fact that if the considered data are pointwise (i.e., if they are not proper intervals), then it recovers the classical concept of this aggregation. Next, we show that if we make use of intervals in multiexpert decision making problems, then the solution at which we arrive may depend on the total order between intervals that has been chosen. For this reason, we conclude the paper by proposing two new algorithms such that the second one allows us, by means of the Shapley value, to pick up the best alternative from a set of winning alternatives provided by the first algorithm.