We extend the application of a voting procedure (usually defined on complete preference relations over candidates) when the votersâ€™ preferences consist of partial orders.Expand

We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independent variables to assign.Expand

We propose a framework for dealing with probabilistic uncertainty in constraint satisfaction problems, associating with each constraint the probability that it is a part of the real problem (the latter being only partially known).Expand

A new framework for propositional merging is presented. DA2 merging operators, parameterized by a distance between interpretations and two aggregation functions, are introduced. Many distances andâ€¦ Expand

In many real-world group decision making problems, the set of alternatives is a Cartesian product of finite value domains for each of a given set of variables (or issues).Expand