Please note that this newsitem has been archived, and may contain outdated information or links.
30 April 2018, ILLC Seminar, Dorothea Baumeister
This talk will give a short introduction into computational social choice, an interdisciplinary field that lies at the interface between social choice theory and computer science. Afterwards the focus is on two different problems of collective decision making. The study of such problems is extremely important, since there are many situation where a collective decision based on individual preferences has to be made. The first part of this talk deals with the modeling of online participation processes and their properties. They will be formalized by abstract argumentation frameworks, where incompleteness is added to the initial model. This extension is more suitable to capture the dynamics of such processes. In this context the verification problem is particularly important, thus its computational complexity will be analyzed for different variants. The second part of the talk focuses on the algorithmic and axiomatic study of committee elections. Committee election rules for different forms of votes that try to minimize the voters’ dissatisfaction will be introduced. Afterwards its axiomatic and algorithmic properties are explored.
Please note that this newsitem has been archived, and may contain outdated information or links.