… We consider the aggregation of the preferences of a set of n agents, N, over a set of outcomes
. The preferences of each agent over the outcomes are modelled by a binary relation (ie a …

We consider preferences which can be partially ordered and which need to be aggregated. …
and three outcomes, no aggregation system on partially ordered preferences can be fair. …

… , the agents’ preferences are represented as partial orders. In this … for linear orders can be
extended to partial orders via our … extensions to profiles of partial orders. Finally, we propose a …

… Preferences of a single agent are often partially ordered. For example, it may be hard to …
We consider here how to aggregate the partially ordered preferences of multiple agents in order …

… We show that this result can be generalized to certain partial orders. In brief, we will say
that a preference aggregation system is fair if it has the following four properties: …

… a belief structure to represent the partially ordered preferences with belief degrees, which can
… , a preference aggregation procedure is needed to combine these partial orders with belief …

… To demonstrate the generality of the new introduced framework, a third application to preference
aggregation is dealt with. A unified decision making procedure based on commonalities …

… using voters’ stated preferences on characteristics to infer a partial order on the alternatives,
and making the social choice by aggregating these inferred preferences on the alternatives. …

… We consider the aggregation of the preferences of a set of n agents, N, over a set of outcomes
. The preferences of each agent over the outcomes are modelled by a binary relation (ie a …

… We also provide the relevant definitions and properties relating to aggregation functions …
partial order based preference relations and their properties. We then consider aggregation …