2 March 2012, Computational Social Choice Seminar, Ulle Endriss

Abstract

Suppose several agents each provide us with a directed graph over a common set of vertices. How can we best aggregate this information into a single graph reflecting the collective opinion of the group? I will discuss this problem of graph aggregation in the context of interpreting formulas of modal logic over the graphs in question, i.e., I will discuss the problem of aggregating Kripke frames. This is joint work with Umberto Grandi.

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