A note on the super-additive and sub-additive transformations of aggregation functions: The multi-dimensional case
For an aggregation function we know that it is bounded by and which are its super-additive and sub-additive transformations, respectively. Also, it is known that if is directionally convex, then and is linear; similarly, if is directionally concave, then and is linear. We generalize these results replacing the directional convexity and concavity conditions by the weaker assumptions of overrunning a super-additive function and underrunning a sub-additive function, respectively.