20 April 2011, Computational Social Choice Seminar, Ilan Frank

Abstract

Information comes up in different problems in computational social choice, but can we come up with a general way of representing voting rules, that would consolidate these different problems in a unified framework? Moreover, what could such a framework give us? In this tutorial talk I will present several of these information-related problems and concepts, such as communication complexity (which deals with efficient ways of transmitting information between voters), compilation complexity (which deals with efficient ways of storing voters' preferences), informational size (measuring the number of “equivalent ballots” per voter), and generalized scoring rules (a representation of voting rules as vectors of numbers), and I will discuss various connections between them.

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