2005
DOI: 10.1016/j.fss.2004.12.005
|View full text |Cite
|
Sign up to set email alerts
|

On the closure of families of fuzzy measures under eventwise aggregations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
0

Year Published

2007
2007
2018
2018

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 16 publications
(20 citation statements)
references
References 23 publications
0
20
0
Order By: Relevance
“…First we recall some results obtained in [2], then we investigate families of aggregation functions by the technique, which is similar to well-known constructions like the condition "avoiding sure loss" or "natural extension" in the theory of imprecise probabilities [11], and finally we prove that the sufficient conditions, found in [2] for aggregation functions, are also necessary ones.…”
Section: Introductionmentioning
confidence: 86%
See 2 more Smart Citations
“…First we recall some results obtained in [2], then we investigate families of aggregation functions by the technique, which is similar to well-known constructions like the condition "avoiding sure loss" or "natural extension" in the theory of imprecise probabilities [11], and finally we prove that the sufficient conditions, found in [2] for aggregation functions, are also necessary ones.…”
Section: Introductionmentioning
confidence: 86%
“…A function : [0, 1] n → [0, 1] is called n-aggregation function (or n-aggregation operator [2,3]) if • g ∈ M 0 for any g = (g 1 , . .…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, by Theorem 2, for a binary aggregation function A with zero annihilator the function F m,A is non-decreasing for each m ∈ M (2) if and only if A-volumes of all possible 2-boxes…”
Section: N) If and Only If For All N-mentioning
confidence: 99%
“…, which in binary case are also obtained from conditions (2), are trivially nonnegative because of the monotonicity of A.…”
Section: N) If and Only If For All N-mentioning
confidence: 99%