Abstract. 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.
Gelain et al. REF consider a similar problem of soft constraint problems where some of the preferences may be unspecified.
Dealing with incomplete preferences in soft constraint problems
CP 2007 (The 13th International Conference on Principles and Practice of Constraint Programming
Computer Science