User preferences are a crucial input needed by recommender systems to determine relevant
items. In single-shot recommendation scenarios such as content-based filtering and …

This chapter covers methods for identifying islands of tractability for NP-hard combinatorial
problems by exploiting suitable properties of their graphical structure. Acyclic structures are …

How do humans or machines make a decision? Whenever we make a decision, we consider
our preferences over the possible options. Also, in a social context, collective decisions are …

This paper aims to introduce an adaptive preference elicitation method for interactive
decision support in sequential decision problems. The Decision Maker's preferences are …

We investigate the computational complexity of finding optimal bribery schemes in voting
domains where the candidate set is the Cartesian product of a set of variables and voters …

Aggregating preferences over combinatorial domains has many applications in artificial
intelligence (AI). Given the inherent exponential nature of preferences over combinatorial …

We investigate the computational complexity of finding optimal bribery schemes in voting
domains where the candidate set is the Cartesian product of a set of variables and agents' …

This book provides a tutorial introduction to modern techniques for representing and
reasoning about qualitative preferences with respect to a set of alternatives. The syntax and …

Constraint Satisfaction Problems (CSPs) typically have many solutions that satisfy all
constraints. Often though, some solutions are preferred over others, that is, some solutions …

We consider a multi-agent scenario where a collection of agents needs to select a common
decision from a large set of decisions over which they express their preferences. This …