• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Preference representation with 3-points intervals

Thumbnail
View/Open
tsoukias-ECAIfinal.pdf (90.38Kb)
Date
2006
Dewey
Intelligence artificielle
Sujet
Preference representation; qualitative preferences
Conference country
ITALY
Book title
ECAI 2006 - 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Author
Traverso, Paolo
Publisher
IOS Press
Publisher city
Amsterdam
Year
2006
ISBN
978-1-58603-642-3
URI
https://basepub.dauphine.fr/handle/123456789/5105
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Tsoukiàs, Alexis
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Ozturk, Meltem
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Type
Communication / Conférence
Item number of pages
417-421
Abstract (FR)
In this article we are interested in the representation ofqualitative preferences with the help of 3-points intervals (a vector ofthree increasingly ordered points). Preferences are crucial when anagent has to autonomously make a choice over several possible ac-tions. We provide first of all an axiomatization in order to character-ize our representation and then we construct a general framework forthe comparison of 3-points intervals. Our study shows that from thefifteen possible different ways to compare 3-points intervals, sevendifferent preference structures can be defined, allowing the represen-tation of sophisticated preferences. We show the usefulness of ourresults in two classical problematics: the comparison of alternativesand the numerical representation of preference structures. Concern-ing the former one, we propose procedures to construct non classicalpreference relations (intransitive preferences for example) over ob-jects being described by three ordered points. Concerning the latterone, assuming that preferences on the pairwise comparisons of ob-jects are known, we show how to associate a 3-points interval to everyobject, and how to define some comparison rules on these intervalsin order to have a compact representation of preferences describedwith these pairwise comparisons.
Abstract (EN)
In this article we are interested in the representation ofqualitative preferences with the help of 3-points intervals (a vector ofthree increasingly ordered points). Preferences are crucial when anagent has to autonomously make a choice over several possible actions. We provide first of all an axiomatization in order to characterize our representation and then we construct a general framework forthe comparison of 3-points intervals. Our study shows that from thefifteen possible different ways to compare 3-points intervals, sevendifferent preference structures can be defined, allowing the representation of sophisticated preferences. We show the usefulness of ourresults in two classical problematics: the comparison of alternativesand the numerical representation of preference structures. Concerning the former one, we propose procedures to construct non classicalpreference relations (intransitive preferences for example) over objects being described by three ordered points. Concerning the latterone, assuming that preferences on the pairwise comparisons of objects are known, we show how to associate a 3-points interval to everyobject, and how to define some comparison rules on these intervalsin order to have a compact representation of preferences describedwith these pairwise comparisons.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.