We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possible privacy issues. In this context, we study how to find an optimal solution without having to wait for all the preferences. In particular, we define an algorithm to find a solution which is necessarily optimal, that is, optimal no matter what the missing data will be, with the aim to ask the user to reveal as few preferences as possible. Experimental results show that in many cases a necessarily optimal solution can be found without eliciting too many preferences. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Gelain, M., Pini, M. S., Rossi, F., & Venable, K. B. (2007). Dealing with incomplete preferences in soft constraint problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4741 LNCS, pp. 286–300). Springer Verlag. https://doi.org/10.1007/978-3-540-74970-7_22
Mendeley helps you to discover research relevant for your work.