Preferences and Domination

Research output: Contribution to journalConference articlepeer-review


We show that the dominance problem for CP-nets is P-hard, and that the dominance problem for the more general ase of cyclic CP-nets is PSPACE omplete.

Original languageEnglish
JournalDagstuhl Seminar Proceedings
StatePublished - 2005
EventAlgebraic Methods in Computational Complexity 2004 - Wadern, Germany
Duration: Oct 10 2004Oct 15 2004

Bibliographical note

Publisher Copyright:
© 2005 Dagstuhl Seminar Proceedings. All rights reserved.


  • CP-nets
  • PSPACE completeness
  • Qualitative preferences
  • complexity

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Control and Systems Engineering


Dive into the research topics of 'Preferences and Domination'. Together they form a unique fingerprint.

Cite this