9 research outputs found
On weak monotonicity of some mixture functions
Monotonicity with respect to all arguments is fundamental to the definition of aggregation functions. Here we study means that are not necessarily monotone. Weak monotonicity was recently proposed as a relaxation of the monotonicity condition for averaging functions. We provide results for the weak monotonicity of some importantclasses of mixture functions. With these results we are able to extend and improve the understanding of this very important class of functions
Invariance property for partial means
We study the properties of the mean-type mappings
of the form
where and -s are positive integers, each is a -variable
mean on an interval , and -s are elements
from . We show that, under some natural assumption on -s,
the problem of existing the unique -invariant mean can be reduced to the
ergodicity of the directed graph with vertexes and edges
Weak monotonicity of Lehmer and Gini means
We analyze directional monotonicity of several mixture functions in the direction (1,1...,1), called weak monotonicity. Our particular focus is on power weighting functions and the special cases of Lehmer and Gini means. We establish limits on the number of arguments of these means for which they are weakly monotone. These bounds significantly improve the earlier results and hence increase the range of applicability of Gini and Lehmer means. We also discuss the case of affine weighting functions and find the smallest constant which ensures weak monotonicity of such mixture functions