2025/10/03 by Michał Boczek, Boczek, Michał, Marek Kałuszka +3
Chemistry · Computer Science · Decision Sciences · #FOS: Mathematics #General Mathematics (math.GM) #History and advancements in chemistry #Multi-Criteria Decision Making #Rough Sets and Fuzzy Logic
paper · pdf · doi:10.48550/arxiv.2510.15928
openalex publication_date 2025/10/03 · openalex created_date 2025/10/22 · openalex updated_date 2026/07/28
Admissible orders play a key role in ranking subintervals of the unit interval. In 2013, Bustince et al. proposed constructing such relations by means of admissible pairs of aggregation functions. The only significant example in the literature is a pair of weighted arithmetic means with different weights. In this paper, we present a method for constructing admissible pairs of aggregation functions, which allows us to verify the admissibility of various function classes, including quasi-linear means, Archimedean t-norms (and t-conorms), and certain strictly Schur-convex (or Schur-concave) functions. Furthermore, we examine the relationship between admissible orders generated by admissible pairs of aggregation functions and the (α, \beta)-order, identifying cases where these two notions do not coincide.