Two classes of aggregation functions: L-statistics and S-statistics and their generalizations called quasi-L-statistics and quasi-S-statistics are considered. Some interesting characterizations of these families of operators are given. The aforementioned functions are useful for various applications. In particular, they are very helpful for modeling the socalled Producer Assessment Problem.

Two linguistic-based voting systems have been introduced in recent years, namely: Majority Judgement (Balinski and Laraki, 2007) and Range Voting (Smith, 2000). The keys for them are aggregation procedures based on the median and the arithmetic mean of the grades assessed to the alternatives, respectively. In this paper a comprehensive framework based on centered OWA operators (Yager, 2007) and...

Certain aggregate externalities, like those due to knowledge and public goods, do not change very much in response to changes in two individuals’ actions. Thus, individuals rationally regard the level of the externality as fixed in their negotiations with each other. We leverage this observation to develop a general framework for the existence of stablematchings inmoderately sized one-to-onemat...

We present in this paper some properties of k-Lipschitz quasi-arithmetic means. The Lipschitz aggregation operations are stable with respect to input inaccuracies, what is a very important property for applications. Moreover, we provide sufficient conditions to determine when a quasi–arithemetic mean holds the k-Lipschitz property and allow us to calculate the Lipschitz constant k. Keywords— k-...

Article history: Received 4 October 2012 Received in revised form 3 August 2013 Accepted 13 August 2013 Available online 27 August 2013

In our contribution we discuss the power stability of 1-Lipschitz binary aggregation functions. The main result is the characterization of power stable quasi-copulas by means of their dependence functions. The notions are illustrated by examples.

We investigate the associativity property for varying-arity aggregation functions and introduce the more general property of preassociativity, a natural extension of associativity. We discuss this new property and describe certain classes of preassociative functions.

In this paper we deal with the problem of aggregating pairwise distance values in order to obtain a multi-argument distance function. After introducing the concept of functionally expressible multidistance, several essential types of multidimensional aggregation functions are considered to construct such kind of multidistances. An example of non functionally expressible multidistance is exhibited.

Queries are widely used for acquiring data distributed in opportunistically formed mobile networks. However, when queries are executed in such dynamic settings, the returned result may not be consistent, i.e., it may not accurately reflect the state of the environment. It can thus be difficult to reason about the meaning of a query’s result. Reasoning about imperfections in the result becomes e...