This editorial of the special issue “Representing, Processing, and Learning Preferences:
Theoretical and Practical Challenges” surveys past and ongoing research on preferences in …

As introduced in Chapter 11 (Thomson, 2015), Fair Division refers to the general problem of
fairly dividing a common resource among agents having different—and sometimes …

Social choice theory concerns the design and formal analysis of methods for aggregating
the preferences of multiple agents. Examples of such methods include voting procedures …

1 Her work has been supported in part by an NRW grant for gender-sensitive universities
supporting her as a junior professor for Computational Social Choice and by the project …

This paper presents the Compaan tool that automatically transforms a nested loop program
written in Matlab into a process network specification. The process network model of …

We study the problem of fairly dividing a set of goods amongst a group of agents, when
those agents have preferences that are ordinal relations over alternative bundles of goods …

Preference logics and AI preference representation languages are both concerned with
reasoning about preferences on combinatorial domains, yet so far these two streams of …

We study multi-type housing markets, where there are p≥ 2 types of items, each agent is
initially endowed one item of each type, and the goal is to design mechanisms without …

We study methods to specify preferences among subsets of a set (a universe). The methods
we focus on are of two types. The first one assumes the universe comes with a preference …

Conditional preference statements have been used to compactly represent preferences over
combinatorial domains. They are at the core of CP-nets and their generalizations, and …