24 February 2011, Computational Social Choice Seminar, Héctor Palacios

Voting in combinatorial domains refers to people choosing from options that are described in terms of a set of variables. Building on existing connections between languages for expressing preferences and planning, we want to obtain effective algorithms for winner determination in combinatorial domains. Indeed, for the well known language of CP-nets, checking whether an agent prefers an option over another one can be cast as a planning problem. We will show some preliminary formulations of problems such as dominance as planning problems, and comment on recent ideas in planning than we hope to be helpful in this line of work.

For more information, see http://www.illc.uva.nl/~ulle/seminar/, or contact Ulle Endriss (ulle.endriss at uva.nl).