This paper proposes a multiexpert decision-making (MEDM) method with linguistic assessments, making use of the notion of random preferences and a so-called satisfactory principle. It is well known that decision-making problems that manage preferences from different experts follow a common resolution scheme composed of two phases: an aggregation phase that combines the individual preferences to obtain a collective preference value for each alternative; and an exploitation phase that orders the collective preferences according to a given criterion, to select the best alternative/s. For our method, instead of using an aggregation operator to obtain a collective preference value, a random preference is defined for each alternative in the aggregation phase. Then, based on a satisfactory principle defined in this paper, that says that it is perfectly satisfactory to select an alternative as the best if its performance is as at least "good" as all the others under the same evaluation scheme, we propose a linguistic choice function to establish a rank ordering among the alternatives. Moreover, we also discuss how this linguistic decision rule can be applied to the MEDM problem in multigranular linguistic contexts. Two application examples taken from the literature are used to illuminate the proposed techniques.

In multiple-attribute decision making (MADM) problems, one often needs to deal with decision information with uncertainty. During the last decade, Yang and Singh (1994) have proposed and developed an evidential reasoning (ER) approach to deal with such MADM problems. Essentially, this approach is based on an evaluation analysis model and Dempster's rule of combination in the Dempster-Shafer (D-S) theory of evidence. This paper reanalyzes the ER approach explicitly in terms of D-S theory and then proposes a general scheme of attribute aggregation in MADM under uncertainty. In the spirit of such a reanalysis, previous ER algorithms are reviewed and two other aggregation schemes are discussed. Theoretically, it is shown that new aggregation schemes also satisfy the synthesis axioms, which have been recently proposed by Yang and Xu (2002) for which any rational aggregation process should grant. A numerical example traditionally examined in published sources on the ER approach is used to illustrate the discussed techniques