Rough approximation of a preference relation by a multi-attribute stochastic dominance for determinist and stochastic evaluation problems

Rough approximation of a preference relation by a multi-attribute stochastic dominance for determinist and stochastic evaluation problems

0.00 Avg rating0 Votes
Article ID: iaor20014240
Country: Netherlands
Volume: 130
Issue: 2
Start Page Number: 305
End Page Number: 314
Publication Date: Apr 2001
Journal: European Journal of Operational Research
Authors:
Keywords: programming: multiple criteria
Abstract:

Let A be a set of actions evaluated by a set of attributes. Two kinds of evaluations will be considered in this paper: determinist or stochastic in relation to each attribute. The multi-attribute stochastic dominance (MSDr) for a reduced number of attributes will be suggested to model the preferences in this kind of problem. The case of mixed data, where we have the attributes of different natures is not well known in the literature, although it is essential from a practical point of view. To apply the MSDr the subset R of attributes from which approximation of the global preference is valid should be known. The theory of Rough Sets gives us an answer on this issue allowing us to determine a minimal subset of attributes that enables the same classification of objects as the whole set of attributes. In our approach these objects are pairs of actions. In order to represent preferential information we shall use a pairwise comparison table. This table is built for subset BA described by stochastic dominance (SD) relations for particular attributes and a total order for the decision attribute given by the decision maker (DM). Using a Rough Set approach to the analysis of the subset of preference relations, a set of decision rules is obtained, and these are applied to a set A\B of potential actions. The Rough Set approach of looking for the reduction of the set of attributes gives us the possibility of operating with MSD.

Reviews

Required fields are marked *. Your email address will not be published.