Rangements BBTOPSIS fondés sur des intervalles de proximités relatives avec qualification des préférences
In this work we propose a ranking procedure. This procedure uses an ordinal information about the criterion weights and a non-cardinal or mixed information for the potential actions evaluation. The advantage of this procedure is that it uses the linear programming software packages to compute the intervals of relative proximities from where the rankings are obtained.
The aggregation of preference relations in group decision-making (GDM) problems can be carried out based on either the reliability of the preference values to be aggregated, as is the case with ordered weighted averaging operators, or on the reliability of the source of information that provided the preferences, as is the case with weighted mean operators. In this paper, we address the problem of aggregation based on the reliability of the source of information, with a double aim: a) To provide...
A generalized notion of lottery is considered, where the uncertainty is expressed by a belief function. Given a partial preference relation on an arbitrary set of generalized lotteries all on the same finite totally ordered set of prizes, conditions for the representability, either by a linear utility or a Choquet expected utility are provided. Both the cases of a finite and an infinite set of generalized lotteries are investigated.