Monday, January 16, 2012
Technische Universität Berlin
Institut für Mathematik
Straße des 17. Juni 136, 10623 Berlin
room MA 041
Lecture - 14:15
Abstract:
Voting problems play a prominent role in the field of computational social choice. There are numerous algorithmic and complexity-theoretic challenges, coming along with "simple" combinatorial problems.
In the first part of the talk, we introduce several NP-hard voting problems.
In the second part, we describe in some more detail
results concerning (Kemeny) rank aggregation and the manipulation
of Borda voting protocols, respectively.
Colloquium - 16:00
Abstract: