Distributivity equations and Mayor’s aggregation operators
Introduction
Aggregation operators play an important role in many different theoretical and practical fields (fuzzy sets theory, theory of optimization, operations research, information theory, engineering design, game theory, voting theory, integration theory, etc.), particularly in decision making theory (see [2], [15], [17], [21], [23]). Lately, a high level of attention is directed towards characterizations of pairs of aggregation operators that are satisfying the distributivity law. Investigation of this problem has roots in [1] and, in recent years, it has been focused on t-norms and t-conorms [15], aggregation operators, quasi-arithmetic means [5], pseudo-arithmetical operations [3], fuzzy implications [30], [31], uninorms and nullnorms [8], [14], [25], [26], [33]. Additionally, many authors are considering distributivity inequalities [9], [10], as well as distributivity equations on a restricted domain [4], [12], [13], [18], [20], [21], [22], [29], [32]. An interesting application of this restricted setting on two Borel-Cantelli lemmas and independence of events for decomposable measures is given in [7].
The aim of this paper is to extend research from [5] towards binary aggregation operators that have either an absorbing element or a neutral element from (0, 1). In [5] the previous problem is solved for one special case, i.e., when neutral elements are limited to 1 and 0 (t-norms and t-conorms). Furthermore, the presented research also extends results form [5] towards non-commutative and non-associative operators. This line of research presents a contemporary topic (see [20], [33]) that is highly interesting since it opens some new possibilities in the utility theory (see [19]). Therefore, the main concern of this paper is how to solve functional equationsandwhere one of unknown functions is an aggregation operator defined in the sense of G. Mayor (see [28]), and another one is either a relaxed uninorm or a relaxed nullnorm [8]. The second part of this paper contains even further extension of this problem involving aggregation operators that have neither neutral nor absorbing element. Also, results presented in this paper are additionally clarifying structure of the observed GM-operators. Since paper [5] has considered only min and max as options for the GM-operators, stricture of the GM-operators for other cases was not investigated, presented results present a step forward for this investigation.
This paper is organized as follows. Section 2 contains preliminary notions concerning aggregation operators defined in the sense of G. Mayor, aggregation operators with neutral and absorbing elements and distributivity equations. Results on distributivity between aggregation operator given in the sense of G. Mayor and relaxed nullnorm are given in the third section. Section 4 consists of results on distributivity between aggregation operator in the sense of G. Mayor and relaxed uninorm from the classes and . Topic of the fifth section is distributivity when one of the aggregation operators has neither neutral nor absorbing element. Some concluding remarks are given in the sixth section.
Section snippets
Preliminaries
A short overview of notions that are essential for this paper is given in this section [6], [8], [16], [17], [21], [24], [28], [34].
Distributivity: GM aggregation operator and relaxed nullnorm
Let us suppose that F is a GM aggregation operator and that G is a relaxed nullnorm, i.e., G ∈ Zs. Two cases can be distinguished: distributivity of G over F and distributivity of F over G.
Distributivity: GM aggregation operator and relaxed uninorm
The logical next step is investigation of aggregation operations with neutral element, i.e., of relaxed uninorms. Therefore, in this section F is a GM aggregation operator and G is a relaxed uninorm from . Again, two cases can be distinguished: distributivity of G over F and distributivity of F over G.
Distributivity: aggregation operators without neutral and absorbing element
In this section we study (LD) law where unknown function F is an aggregation operator that has neither absorbing nor neutral element. First, let us recall the well known result (see [5], [15], [17], [21]). Theorem 26 Let T be a t-norm and S be a t-conorm, then T is distributive over S if and only if S = max, S is distributive over T if and only if T = min.
The focus of the presented results is on the case (i) since the results for the case (ii) can be obtained analogously. It is easy to show that Theorem 26 holds
Conclusion
In this paper we have considered distributivity equations where one of unknown functions is the GM aggregation operator [28]. Results in Sections 3 Distributivity: GM aggregation operator and relaxed nullnorm, 4 Distributivity: GM aggregation operator and relaxed uninorm, where another function is relaxed nullnorm or relaxed uninorm [8], extend corresponding ones from [5]. Theorem 18 significantly clarifies structure of the GM-operators. Also, we have seen that distributivity law is a strong
Acknowledgment
This paper has been supported by the Ministry of Science and Technological Development of Republic of Serbia 174009 and by the Provincial Secretariat for Science and Technological Development of Vojvodina.
References (34)
- et al.
Pseudo-arithmetical operations as a basis for the general measure and integration theory
Information Sciences
(2004) - et al.
On the distributivity between t-norms and t-conorms
Fuzzy Sets and Systems
(2004) On some solutions of the distributivity equations
Fuzzy Sets and Systems
(1999)- et al.
The functional equations of Frank and Alsina for uninorms and nullnorms
Fuzzy Sets and Systems
(2001) - et al.
Distributivity between uninorms and nullnorms
Fuzzy Sets and Systems
(2008) - et al.
Subdistributivity and superdistributivity of binary operations
Fuzzy Sets and Systems
(2010) - et al.
Distributivity inequalities of monotonic operations
Fuzzy Sets and Systems
(2012) - et al.
The distributive equations for idempotent uninorms and nullnorms
Fuzzy Sets and Systems
(2005) - et al.
Restricted distributivity for aggregation operators with absorbing element
Fuzzy Sets and Systems
(2013) - et al.
The distributivity condition for uninorms and t-operators
Fuzzy Sets and Systems
(2002)
Corrigendum to The distributivity condition for uninorms and t-operators [Fuzzy Sets and Systems 128 (2002), 209-225]
Fuzzy Sets and Systems
Distributivity of residual implications over conjuctive and disjunnctive uninorms
Fuzzy Sets and Systems
On the distributivity of uninorms over nullnorms
Fuzzy Sets and Systems
Uninorm aggregation operators
Fuzzy Sets and Systems
Lectures on Functional Equations and their Applications
Aggregation Functions: A Guide for Practitioners
Independence and convergence in non-additive settings
Fuzzy Optimization and Decision Making
Cited by (19)
Distributivity between uni-nullnorms and Mayor's aggregation operators
2022, International Journal of Approximate ReasoningCitation Excerpt :Those additional properties derive from the process of solving functional equations involving observed aggregation operators. The study of distributivity equations starts with [1] and, through t-norms and t-conorms (see [15]), in recent years, by extending to uninorms, nullnorms, semi-nullnorms, semi-uninorms, semi-t-operators, uni-nullnorms, 2-uninorms, Mayor's aggregation operators, etc (see [3,5–7,11,12,14,19–22,25,27,29,30]). The significance of this contemporary topic (see [10,11,25,26,30]) follows not only from the theoretical point of view, but also from its applicability in the utility theory [9,13] and integration theory [15].
The modularity equation with Mayor's aggregation operators and semi-t-operators
2021, Fuzzy Sets and SystemsDistributivity and conditional distributivity for S-uninorms
2019, Fuzzy Sets and SystemsThe modularity law in some classes of aggregation operators
2018, Fuzzy Sets and SystemsCitation Excerpt :One of the main topics in the study of aggregation operations from a theoretical viewpoint is the characterization of pairs that satisfy functional equations, which can be useful in various contexts. Functional equations involving aggregation operations (e.g., [3–5,7,19,30]) play an important role in theories of fuzzy sets and fuzzy logic. A new area of research is concerned with the distributivity (restricted distributivity) equation and inequalities for uninorms and nullnorms, as well as their generalizations (e.g., see [8,9,18,23,29]).
Distributivity and conditional distributivity for T-uninorms
2018, Information SciencesCross-ratio uninorms as an effective aggregation mechanism in sentiment analysis
2017, Knowledge-Based SystemsCitation Excerpt :The authors cover aggregation functions and their fundamental properties, with four main classes of aggregation functions being identified. In [12], Jočić and Štajner–Papuga focus on pairs of binary aggregation operators on the unit interval that verify the distributivity law, which is important in the utility theory. More recently, Wu et al. [25,26] present an interesting discussion on the use of aggregation methods for group decision-making in the specific context of social networks.