Institute for Logic, Language and Computation

10 June 2011, Computational Social Choice Seminar, Erik Parmann

Speaker: Erik Parmann
Title: Expressing Properties of Social Choice Functions Using Modal Logic
Date: Friday 10 June 2011
Time: 16:00
Location: Room D1.116, Science Park 904, Amsterdam


We will look at the possibility of expressing properties of social choice functions in a modal logic, and we will look at a specific modal logic created to do this. This logic is simple, while still strong enough to express the properties involved in the Gibbard-Satterthwaite theorem. Then we observe that a very simple fragment of this language has tight connections to the logic of products of S5 frames, a logic with undesirable computational properties. We will then discuss to what extent this is a negative result for the overall goal of finding an expressive logic for this domain with nice computational properties.

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