The Open UniversitySkip to content

Aggregation functions with given super-additive and sub-additive transformations

Kouchakinejad, Fateme; Šipošová, Alexandra and Širáň, Jozef (2017). Aggregation functions with given super-additive and sub-additive transformations. International Journal of General Systems, 46(3) pp. 225–234.

Full text available as:
[img] PDF (Accepted Manuscript) - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (270kB)
DOI (Digital Object Identifier) Link:
Google Scholar: Look up in Google Scholar


Aggregation functions and their transformations have found numerous applications in various kinds of systems as well as in economics and social science. Every aggregation function is known to be bounded above and below by its super-additive and sub-additive transformations. We are interested in the “inverse” problem of whether or not every pair consisting of a super-additive function dominating a sub-additive function comes from some aggregation function in the above sense. Our main results provide a negative answer under mild extra conditions on the super- and sub-additive pair. We also show that our results are, in a sense, best possible.

Item Type: Journal Item
Copyright Holders: 2017 Informa UK Limited
ISSN: 1563-5104
Keywords: aggregation function; sub-additive and super-additive transformation
Academic Unit/School: Faculty of Science, Technology, Engineering and Mathematics (STEM) > Mathematics and Statistics
Faculty of Science, Technology, Engineering and Mathematics (STEM)
Item ID: 52815
Depositing User: Jozef Širáň
Date Deposited: 08 Jan 2018 10:03
Last Modified: 11 Jun 2020 19:11
Share this page:


Altmetrics from Altmetric

Citations from Dimensions

Download history for this item

These details should be considered as only a guide to the number of downloads performed manually. Algorithmic methods have been applied in an attempt to remove automated downloads from the displayed statistics but no guarantee can be made as to the accuracy of the figures.

Actions (login may be required)

Policies | Disclaimer

© The Open University   contact the OU