摘要

For an aggregation function A we know that it is bounded by A* and A(*) which are its super-additive and sub-additive transformations, respectively. Also, it is known that if A* is directionally convex, then A = A* and A(*) is linear; similarly, if A(*) is directionally concave, then A = A(*) and A* 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.

  • 出版日期2017