Abstract
The privileged preference representation used for combinatorial problems has been the objective function. It is almost exclusively used at every aggregation levels of a hierarchical preference model, and has remarkable structural properties as transitivity and completeness. These properties are often judged too restrictive, because some important aggregation concepts are incomplete by definition, as efficiency and equity. Moreover, preferences are not necessarily transitive because of uncertainty. For all these reasons, we decided to enlarge objective function-based combinatorial problems toward weaker structured preference concepts: preference binary relations.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joseph, RR., Chan, P., Hiroux, M., Weil, G. (2003). Preference Constraints: New Global Soft Constraints Dedicated to Preference Binary Relations. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_101
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_101
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive