Dear all,
The next talk in the Computational Social Choice Seminar at the ILLC is this coming Monday already. Adrian Haret (Vienna) will talk about the aggregation of CP-nets at 15:00. I include the abstract below.
As always, for more information on the COMSOC Seminar, please consult https://staff.science.uva.nl/u.endriss/seminar/.
All the best, Ulle
-------------------------------------------------------------------------
Speaker: Adrian Haret (Vienna) Title: Preference Aggregation with Incomplete CP-nets Date: Monday 4 March 2019 Time: 15:00 Location: Room F1.15, Science Park 107, Amsterdam
Abstract: Generalized CP-nets (gCP-nets) extend standard CP-nets by allowing conditional preference tables to be incomplete. Such generality is desirable, as in practice users may want to express preferences over the values of a variable that depend only on partial assignments for other variables. In this paper we study aggregation of gCP-nets, under the name of multiple gCP-nets (mgCP-nets). Inspired by existing research on mCP-nets, we define different semantics for mgCP-nets and study the complexity of prominent reasoning tasks such as dominance, consistency and various notions of optimality.