TITLE: Multiwinner Elections: Applications, Axioms, and Algorithms
ABSTRACT: The goal of multiwinner elections is to select a group of k individuals (the committee) based on the preferences of a number of agents (voters). While the most prominent example of multiwinner elections comes from the world of politics (parliamentary elections held in almost all modern democracies), they are present nearly everywhere and include choosing other representative bodies (e.g., working groups to deal with particular issues), making various business decisions (e.g., choosing products for an Internet store to put on its homepage, choosing movies to put on a transatlantic flight), or shortlisting tasks (e.g., shortlisting applicants for a given academic position).
In this tutorial we will present a number of applications of multiwinner voting (including the ones mentioned above, but also, e.g., their use in genetic algorithms), a number of multiwinner voting rules, and a number of algorithms for computing them (most of the rules are NP-hard to compute). Based on the axiomatic properties of the rules and on simulation results, we will argue which rules are best-suited for particular applications.
No prior knowledge of computational social choice (i.e., COMSOC) is assumed. The attendees interested in COMSOC will learn cutting-edge results and interesting techniques. Multiagent systems designers will learn a new set of tools. Everyone will enjoy a fresh perspective on voting and democracy!
SPEAKERS: Piotr Faliszewski; Piotr Skowron; Nimrod Talmon
TUTORIAL WEB PAGE: Link
Back to the list