Institute for Logic, Language and Computation

20 April 2011, Computational Social Choice Seminar, Ilan Frank

Speaker: Ilan Frank
Title: Information as a Descriptive Tool in Computational Social Choice
Date: Wednesday 20 April 2011
Time: 16:00
Location: Room D1.113, Science Park 904, Amsterdam


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, or contact Ulle Endriss ().

The websites of the UvA make use of cookiesThis site uses cookies More informationMore info Hide this message XHide X