License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-1038
URL: http://drops.dagstuhl.de/opus/volltexte/2005/103/

Goldsmith, Judy

Preferences and Domination

pdf-format:
Dokument 1.pdf (240 KB)


Abstract

CP-nets are a succinct formalism for specifying preferences over a multi-featured domain. A CP-net consists of a directed graph, with nodes representing the features of the domain, and edges indicating conditional preferences. An instance in the domain is an assignment of values to the features. An instance alpha is preferred to an instance beta if there are a sequence of "improving flips" from alpha to beta, where an improving flip changes the value of one feature to a more-preferred value, based on the values of the parents of that feature. We say alpha dominates beta if such a sequence exists. We show that recognizing dominance is PSPACE hard for cyclic CP-nets.

BibTeX - Entry

@InProceedings{goldsmith:DSP:2005:103,
  author =	{Judy Goldsmith},
  title =	{Preferences and Domination},
  booktitle =	{Algebraic Methods in Computational Complexity},
  year =	{2005},
  editor =	{Harry Buhrman and Lance Fortnow and Thomas Thierauf},
  number =	{04421},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2005/103},
  annote =	{Keywords: Preferences , CP-nets , PSPACE-complete , reductions}
}

Keywords: Preferences , CP-nets , PSPACE-complete , reductions
Seminar: 04421 - Algebraic Methods in Computational Complexity
Issue date: 2005
Date of publication: 24.03.2005


DROPS-Home | Fulltext Search | Imprint Published by LZI