[en] We define an aggregation function to be (at most) k-intolerant if it is bounded from above by its kth lowest input value. Applying this definition to the discrete Choquet integral and its underlying capacity, we introduce the concept of k-intolerant capacities which, when varying k from 1 to n, cover all the possible capacities on n objects. Just as the concepts of k-additive capacities and p-symmetric capacities have been previously introduced essentially to overcome the problem of computational complexity of capacities, k-intolerant capacities are proposed here for the same purpose but also for dealing with intolerant or tolerant behaviors of aggregation.
University of Luxembourg - UL
F2R-SMA-PUL-03AADC > Aide à la décision / classification > 01/01/2003 – 31/12/2004 > BISDORFF Raymond
[University of Luxembourg > Faculty of Law, Economics and Finance > Applied Mathematics Unit (SMA)]
