COST Action on Algorithmic Decision Theory
Ulle Endriss, University of Amsterdam
STSM to University of Padova, 24-28 May 2010

During the week of 24-28 May 2010, I visited the group of Francesca Rossi at the University of Padova on an STSM supported by the COST Action on Algorithmic Decision Theory. The week was spent continuing our earlier joint work on voting with restricted ballot languages and on the notion of strategy-proofness in this framework. This line of work was started during a similar STSM to Padova in 2008 and initial results have already been published in a paper that appeared in the proceedings of IJCAI-2009 1. We have now been able to strengthen and generalise several of these results. In particular, our new results cover a broader spectrum of principles for lifting preferences over individual candidates to sets of candidates.

1 Ulle Endriss, Maria Silvia Pini, Francesca Rossi, and K. Brent Venable.
Preference Aggregation over Restricted Ballot Languages: Sincerity and Strategy-Proofness.
Proc. 21st International Joint Conference on Artificial Intelligence (IJCAI-2009), pages 122-127, July 2009.