Notes on bipolar outranking

نویسنده

  • Denis Bouyssou
چکیده

We consider a finite set of alternatives A = {a1, a2, . . . , am} evaluated on a family of n criteria F = {g1, g2, . . . , gn}. Let N = {1, 2, . . . , n}. To each criterion gi ∈ F is assigned a positive weight wi. It is supposed wlog that the weights are normalized so that ∑n i=1wi = 1. Let Xi = {gi(a) : a ∈ A} be the set of evaluations of the alternatives on the ith criterion. It is supposed that a semi-order Pi (i.e., an asymmetric, Ferrers and semitransitive binary relation) is defined on Xi. We denote by Ii the symmetric complement of Pi. Let Si = Pi ∪ Ii. The relations Pi (resp. Ii) models strict preference (resp. indifference) on the ith criterion. In order to model discordance, we introduce a second semiorder Vi on Xi. It is supposed that Vi ⊆ Pi and that there is a weak order compatible with both Pi and Vi (i.e., there is a weak order %i on Xi such that [α %i β and β Pi γ implies α Pi γ] and [α %i β and δ Pi α implies δ Pi β], with similar relations holding with Vi instead of Pi).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploitation of a bipolar-valued outranking relation for the choice of k best alternatives

This article presents the problem of the selection of k best alternatives in the context of multiple criteria decision aid. We situate ourselves in the context of pairwise comparisons of alternatives and the underlying bipolar-valued outranking digraph. We present three formulations for the best k-choice problem and detail how to solve two of them directly on the outranking digraph. Mots-Clefs....

متن کامل

7024 ANNALES DU LAMSADE N ° 6 Octobre 2006

In this paper we would like to thoroughly cover the problem of computing all kernels, i.e. minimal outranking and/or outranked independent choices in a bipolarvalued outranking digraph. First we introduce in detail the concept of bipolar-valued characterisation of outranking digraphs, choices and kernels. In a second section we present and discuss several algorithms for enumerating the kernels ...

متن کامل

Elicitation of criteria weights maximising the stability of pairwise outranking statements

We propose an indirect approach for assessing criteria importance weights from overall outranking statements that a decision-maker may acknowledge in a Multiple Criteria Decision Aid process. Our approach takes advantage of the bipolar characteristic valuation of the overall outranking and the stability of its associated median-cut, crisp outranking relation. Numerical criteria importance weigh...

متن کامل

Disaggregation of Bipolar-Valued Outranking Relations

In this article, we tackle the problem of exploring the structure of the data which is underlying a bipolar-valued outranking relation. More precisely, we show how the performances of alternatives and weights related to criteria can be determined from three different formulations of the bipolar-valued outranking relations, which are given beforehand.

متن کامل

RuBy : a bipolar-valued outranking method for the best choice decision problem

The main concern of this article is a detailed presentation of the RuBy methodology for the best choice problem in the context of multiple criteria decision aid. We focus more particularly on pairwise comparisons of decision objects which lead to the concept of bipolar-valued outranking digraph. The work is centred around a list of five pragmatic principles which are required in the context of ...

متن کامل

R UBIS : a bipolar-valued outranking method for the choice problem

The main concern of this article is to present and motivate the Rubis method for tackling the choice problem in the context of multiple criteria decision aiding. Its genuine purpose is to help a decision maker to determine a single best decision alternative. Methodologically we focus on pairwise comparisons of these alternatives which lead to the concept of bipolar-valued outranking digraph. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006