We present an efficient approach to adding soft constraints, in the form of preferences, to Disjunctive Temporal Problems (DTPs) and their subclass Temporal Constraint Satisfactio...
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
We study the problem of allocating a set of indivisible goods to a set of agents having additive preferences. We introduce two new important complexity results concerning efficienc...
Bart de Keijzer, Sylvain Bouveret, Tomas Klos, Yin...
It is well-known that linguistic decision-making problems that manage preferences from different experts follow a common resolution scheme composed by two phases: an aggregation p...
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...