1199. On the extension of the notion of transitive closure in preference graphs
Invited abstract in session WA-10: Pairwise comparisons and preference relations 2, stream Multiple Criteria Decision Aiding.
Wednesday, 8:30-10:00Room: Clarendon SR 1.06
Authors (first author is the speaker)
| 1. | Alexis Tsoukias
|
| CNRS - LAMSADE | |
| 2. | Meltem Ozturk
|
| LAMSADE, Universite Paris Dauphine |
Abstract
In this talk we present an extension of the notion of transitive closure (and negative transitive closure) on graphs aiming at representing preference statements under form of binary relations. For this purpose we use signed graphs (positively and negatively). On the one hand we obtain an extended model for adding or eliminating positive and negative reasons for or against a preference statement and the other hand we show how this can be used for the design of decision support procedures.
Keywords
- Decision Analysis
- Artificial Intelligence
- Decision Theory
Status: accepted
Back to the list of papers