@INCOLLECTION { Rsds2894,
author = {Greco, Salvatore and Matarazzo, Benedetto and Slowinski, Roman}, 
title = {Rough Approximation of a Preference Relation in a Pairwise Comparison Table}, 
booktitle = {Rough Sets in Knowledge Discovery 2. Applications, Case Studies and Software Systems}, 
series =  = {Studies in Fuzziness and Soft Computing}, 
pages = {13--36}, 
publisher = {Physica-Verlag}, 
address = {Heidelberg, Germany}, 
year = 1998, 
editor = {Polkowski, Lech and Skowron, Andrzej}, 
isbn = {3-7908-1120-3}, 
abstract = {A methodology for using rough sets for preferences modeling in multicriteria decision problems is presented. It operates on a pairwise comparison table (PCT), i.e., an information tables whose objects are pairs of actions instead of single actions, and whose entries are binary relations (graded preference relations) instead of attribute values. PCT is a specific information table and, therefore, all the concepts of the rough set analysis can be adapted to it. However, the classical rough set approximations based on indiscernibility relation do not consider the ordinal properties of the criteria in a decision problem. To deal with these properties, a rough approximation based on graded dominance relations has been recently proposed. The decision rules obtained from these rough approximations can be used to obtain a recommendation in different multi-criteria decision problems. The methodology is illustrated by an example which compares the results obtained when using the rough approximation by indiscernibility relation and the rough approximation by graded dominance relations, respectively.}, 
keywords = {rough sets theory (RST), peirwise comparison table, multi-criteria decision problems, preference modeling, decision rules, }, 
}