• 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

Representing interval orders by weighted bases: Some complexity results

Thumbnail
View/Open
representing_interval.PDF (160.3Kb)
Date
2009
Dewey
Recherche opérationnelle
Sujet
Computational complexity; Compact representation of preferences; Preferences over combinatorial domains
Journal issue
Mathematical Social Sciences
Volume
57
Number
3
Publication date
2009
Article pages
367-388
Publisher
Elsevier
DOI
http://dx.doi.org/10.1016/j.mathsocsci.2008.12.011
URI
https://basepub.dauphine.fr/handle/123456789/5300
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Ozturk, Meltem
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Marquis, Pierre
Type
Article accepté pour publication ou publié
Abstract (EN)
This paper is centered on the notion of interval order as a model for preferences. We introduce a family of representation languages for such orders, parameterized by a scale and an aggregation function. We show how interval orders can be represented by elements of those languages, called weighted bases. We identify the complexity of the main decision problems to be considered for exploiting such representations of interval orders (including the comparison problems and the non-dominance problem). We also show that our representation of interval orders based on weighted bases encompasses the penalty-based representation of complete preorders as a specific case.

  • 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.