Learn More
The most often used operator to aggregate criteria in decision making problems is the classical weighted arithmetic mean. In many problems however, the criteria considered interact, and a substitute to the weighted arithmetic mean has to be adopted. We show that, under rather natural conditions, the discrete Choquet integral is an adequate aggregation(More)
In this paper, we present a model allowing to determine the weights related to interacting criteria. This is done on the basis of the knowledge of a partial ranking over a reference set of alternatives (prototypes), a partial ranking over the set of criteria, and a partial ranking over the set of interactions between pairs of criteria.
Aggregation is the process of combining several numerical values into a single representative value, and an aggregation function performs this operation. These functions arise wherever aggregating information is important: applied and pure mathematics (probability, statistics, decision theory, functional equations), operations research, computer science,(More)
This paper introduces four alternative representations of a set function: the Möbius transformation, the co-Möbius transformation, and the interactions between elements of any subset of a given set as extensions of Shapley and Banzhaf values. The links between the five equivalent representations of a set function are emphasized in this presentation .
The concept of system signature was introduced by Samaniego for systems whose components have i.i.d. lifetimes. We consider its extension to the continuous dependent case and give an explicit expression for this extension as a difference of weighted means of the structure function values. We then derive a formula for the computation of the coefficients of(More)
The concept of signature was introduced by Samaniego for systems whose components have i.i.d. lifetimes. This concept proved to be useful in the analysis of theoretical behaviors of systems. In particular, it provides an interesting signature-based representation of the system reliability in terms of reliabilities of k-out-of-n systems. In the non-i.i.d.(More)
This paper deals with the characterization of two classes of monotonic and neutral (MN) aggregation operators. The first class corresponds to (MN) aggregators which are stable for the same positive linear transformations and present the ordered linkage property. The second class deals with (MN)-idempotent aggregators which are stable for positive linear(More)