Sciweavers

1260 search results - page 14 / 252
» Bipolar Preference Problems
Sort
View
AAAI
2004
13 years 11 months ago
Low-cost Addition of Preferences to DTPs and TCSPs
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...
Bart Peintner, Martha E. Pollack
IMPERIAL
1993
14 years 1 months ago
Prioritising Preference Relations
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...
Mark Ryan
ALDT
2009
Springer
149views Algorithms» more  ALDT 2009»
14 years 1 months ago
On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
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...
HICSS
2005
IEEE
132views Biometrics» more  HICSS 2005»
14 years 3 months ago
Multi-Expert Decision-Making with Linguistic Information: A Probabilistic-Based Model
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...
Van-Nam Huynh, Yoshiteru Nakamori
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 10 months ago
Local search for stable marriage problems with ties and incomplete lists
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, ...